1729 search results - page 188 / 346 » On Bounds for the k-Partitioning of Graphs |
175
click to vote
WEA
2005
Springer
15 years 12 months ago
2005
Springer
This work is motivated by the long-standing open problem of designing a polynomial-time algorithm that with high probability constructs an asymptotically maximum independent set in...
207
click to vote
ALT
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sa...
187
click to vote
DIALM
2005
ACM
15 years 8 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
168
click to vote
CCCG
2004
15 years 7 months ago
2004
We consider three-dimensional grid-drawings of graphs with at most one bend per edge. Under the additional requirement that the vertices be collinear, we prove that the minimum vo...
171
click to vote
UAI
2003
15 years 7 months ago
2003
We analyze a new property of directed acyclic graphs (DAGs), called layerwidth, arising from a class of DAGs proposed by Eiter and Lukasiewicz. This class of DAGs permits certain ...