1729 search results - page 137 / 346 » On Bounds for the k-Partitioning of Graphs |
69
Voted
NIPS
2008
14 years 11 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum d...
97
Voted
COLOGNETWENTE
2009
14 years 11 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
91
Voted
GD
2008
Springer
14 years 11 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
ALGORITHMICA
2000
14 years 10 months ago
2000
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...