6740 search results - page 407 / 1348 » An s -Hamiltonian Line Graph Problem |
148
click to vote
COCOON
2007
Springer
16 years 28 days ago
2007
Springer
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
146
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...
174
Voted
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
182
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
201
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...