Zobrazeno 1 - 10
of 169
pro vyhledávání: '"Rahul A. S"'
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new algorithms for
Externí odkaz:
http://arxiv.org/abs/2011.04778
Let G be an undirected simple graph having n vertices and let f be a function defined to be f:V(G) -> {0,..., n-1}. An f-factor of G is a spanning subgraph H such that degree of a vertex v in H is f(v) for every vertex v in V(G). The subgraph H is ca
Externí odkaz:
http://arxiv.org/abs/1812.02037
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Mary Jasmin, N., Beena, T., Senthil, S., Sakthi, S., Ramesh Kumar, M., Rahul Alex, S., Subbiah, Ram
Publikováno v:
In Materials Today: Proceedings 2023 74 Part 1:40-43
Autor:
Mary Jasmin, N., Rahul, V., Senthil Kannan, N., Navaneeth, V.R., Senthil, T.S., Rahul Alex, S., Subbiah, Ram, Balamurugan, K.
Publikováno v:
In Materials Today: Proceedings 2023 74 Part 1:15-19
The Group Activity Selection Problem (GASP) models situations where a group of agents needs to be distributed to a set of activities while taking into account preferences of the agents w.r.t. individual activities and activity sizes. The problem, alo
Externí odkaz:
http://arxiv.org/abs/1808.06954
Autor:
Raguraman, D., Sakthivel, P., Paramasivam, V., Girisha, L., Krishnamoorthy, S., Rahul Alex, S., Subbiah, R.
Publikováno v:
In Materials Today: Proceedings 2022 66 Part 3:1088-1092
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Narayanaswamy, N S, Rahul, C S
It is well known that when $f(v)$ is a constant for each vertex $v$, the connected $f$-factor problem is NP-Complete. In this note we consider the case when $f(v) \geq \lceil \frac{n}{2.5}\rceil$ for each vertex $v$, where $n$ is the number of vertic
Externí odkaz:
http://arxiv.org/abs/1601.06291
Autor:
Narayanaswamy, N. S., Rahul, C. S.
Given an undirected graph G = (V, E) with n vertices, and a function f : V -> N, we consider the problem of finding a connected f -factor in G. In this work we design an algorithm to check for the existence of a connected f -factor, for the case wher
Externí odkaz:
http://arxiv.org/abs/1507.07856