Zobrazeno 1 - 10
of 57
pro vyhledávání: '"C. R. Subramanian"'
Autor:
Joel Spencer, C. R. Subramanian
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 10, Iss 2 (2008)
Let D ∈ D(n,p) denote a simple random digraph obtained by choosing each of the (n choose 2) undirected edges independently with probability 2p and then orienting each chosen edge independently in one of the two directions with equal probability 1/2
Externí odkaz:
https://doaj.org/article/c0d7c1efe45649c68a346d881d5456fd
Autor:
R. Balasubramanian, C. R. Subramanian
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 8, Iss 1 (2006)
We study the problem of efficiently sampling k-colorings of bipartite graphs. We show that a class of markov chains cannot be used as efficient samplers. Precisely, we show that, for any k, 6 ≤ k ≤ n {1/3-ε}, ε > 0 fixed, almost every bipartite
Externí odkaz:
https://doaj.org/article/8c8876acadfb43efbbaa2aca9f0f65cf
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 7, Iss 1 (2005)
The chordality of a graph with at least one cycle is the length of the longest induced cycle in it. The odd (even) chordality is defined to be the length of the longest induced odd (even) cycle in it. Chordal graphs have chordality at most 3. We show
Externí odkaz:
https://doaj.org/article/d8e4029d9534465cb0927f28d49a9468
Autor:
C. R. Subramanian
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 4, Iss 2 (2001)
Fix positive integers k and l. Consider a random k-partite graph on n vertices obtained by partitioning the vertex set into V i, (i=1, …,k) each having size Ω(n) and choosing each possible edge with probability p. Consider any vertex x in any V i
Externí odkaz:
https://doaj.org/article/1e9f5f212ae0463cacf03d7aaf414ca7
Autor:
Kunal Dutta, C. R. Subramanian
Publikováno v:
SIAM Journal on Discrete Mathematics. 37:279-303
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::572d969a70596fc0780624c833c536a7
https://doi.org/10.1137/21m1409895
https://doi.org/10.1137/21m1409895
Publikováno v:
GLOBECOM 2022 - 2022 IEEE Global Communications Conference.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35a19cb56b646fc49432c33a8d369ecf
https://doi.org/10.1109/globecom48099.2022.10001397
https://doi.org/10.1109/globecom48099.2022.10001397
Publikováno v:
IEEE Transactions on Network Science and Engineering. 8:3048-3060
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::848905cb9e9e9b6d10f5afede79f5a9b
https://doi.org/10.1109/tnse.2021.3102188
https://doi.org/10.1109/tnse.2021.3102188
Autor:
N. R. Aravind, C. R. Subramanian
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 1, Pp 153-166 (2021)
We show that the intersection dimension of graphs with respect to several hereditary properties can be bounded as a function of the maximum degree. As an interesting special case, we show that the circular dimension of a graph with maximum degree Δ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9e48a8148877c00cefc816cbda63c483
https://doaj.org/article/64e05fddbf724e1db1b7e56b32607c39
https://doaj.org/article/64e05fddbf724e1db1b7e56b32607c39
Autor:
C. R. Subramanian
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 14
We introduce and study an inductively defined analogue [Formula: see text] of any increasing graph invariant [Formula: see text]. An invariant [Formula: see text] is increasing if [Formula: see text] whenever [Formula: see text] is an induced subgrap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::72304413a44d2278323c58359e12dae5
https://doi.org/10.1142/s1793830922500197
https://doi.org/10.1142/s1793830922500197
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 14
In this paper, we present an approximation algorithm for the maximum independent set (MIS) problem over the class of [Formula: see text]-VPG graphs when the input is specified by a [Formula: see text]-VPG representation. We obtain a [Formula: see tex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6680f37322a803ec42340c7cba92328d
https://doi.org/10.1142/s1793830922500355
https://doi.org/10.1142/s1793830922500355