53 search results - page 5 / 11 » Spectral Densest Subgraph and Independence Number of a Graph |
SIROCCO
2001
14 years 11 months ago
2001
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...
96
Voted
COCOON
2000
Springer
15 years 1 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
83
Voted
DM
2006
14 years 9 months ago
2006
Let n(G) denote the number of vertices of a graph G and let (G) be the independence number of G, the maximum number of pairwise nonadjacent vertices of G. The Hall ratio of a grap...
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
GBRPR
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We present a new method (MIDES) to determine contraction kernels for the construction of graph pyramids. Experimentally the new method has a reduction factor higher than ...