Sciweavers

1027 search results - page 5 / 206
» Ordered Vertex Partitioning
Sort
View
JCT
2000
65views more  JCT 2000»
13 years 7 months ago
Vertex Partitions by Connected Monochromatic k-Regular Graphs
Gábor N. Sárközy, Stanley M. Se...
CORR
2010
Springer
46views Education» more  CORR 2010»
13 years 4 months ago
Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning
Mihail N. Kolountzakis, Gary L. Miller, Richard Pe...
IPPS
2008
IEEE
14 years 1 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri
STOC
2006
ACM
106views Algorithms» more  STOC 2006»
14 years 7 months ago
Finding small balanced separators
Let G be an n-vertex graph that has a vertex separator of size k that partitions the graph into connected components of size smaller
Uriel Feige, Mohammad Mahdian
ARSCOM
2004
124views more  ARSCOM 2004»
13 years 7 months ago
The Domatic Number of Regular Graphs
The domatic number of a graph G is the maximum number of dominating sets into which the vertex set of G can be partitioned. We show that the domatic number of a random r-regular g...
Peter Dankelmann, Neil J. Calkin