2314 search results - page 84 / 463 » Minimal Partitions of a Graph |
133
click to vote
FOCS
2002
IEEE
15 years 8 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
118
Voted
TALG
2008
15 years 3 months ago
2008
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in
107
Voted
CIAC
2010
Springer
16 years 26 days ago
2010
Springer
The linear arboricity la(G) of a graph G is the minimum number of linear forests that partition the edges of G. In 1984, Akiyama et al. [1] stated the Linear Arboricity Conjecture...
148
Voted
COLT
2004
Springer
15 years 9 months ago
2004
Springer
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
114
Voted
STOC
2005
ACM
16 years 3 months ago
2005
ACM
We show that there is no log log M log log log M -approximation for the undirected congestion minimization problem unless NP ZPTIME(npolylog n ), where M is the size of the grap...