1729 search results - page 27 / 346 » On Bounds for the k-Partitioning of Graphs |
RANDOM
2001
Springer
15 years 2 months ago
2001
Springer
d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raym...
103
click to vote
RSA
2010
14 years 8 months ago
2010
: We study a random graph model which is a superposition of bond percolation on Zd with parameter p, and a classical random graph G(n, c/n). We show that this model, being a homoge...
CORR
2012
Springer
13 years 5 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
104
click to vote
SODA
2010
ACM
14 years 8 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
SIAMDM
2000
14 years 9 months ago
2000
We establish that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian. Furthermore, this bound is determined to be sharp and we present all nonhamil...