6740 search results - page 66 / 1348 » An s -Hamiltonian Line Graph Problem |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
For an edge-weighted connected undirected graph, the minimum k-way cut problem is to find a subset of edges of minimum total weight whose removal separates the graph into k connect...
JGT
2010
13 years 6 months ago
2010
Let G(V, E) be a simple, undirected graph where V is the set of vertices and E is the set of edges. A b-dimensional cube is a Cartesian product I1 × I2 × · · · × Ib, where ea...
SIGMETRICS
2010
ACM
13 years 6 months ago
2010
ACM
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
COMGEO
2011
ACM
13 years 2 months ago
2011
ACM
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the follo...
IWOCA
2009
Springer
14 years 2 months ago
2009
Springer
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...