646 search results - page 17 / 130 » Generalized connected domination in graphs |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
In an undirected graph G = (V, E), a subset C V such that C is a dominating set of G, and each vertex in V is dominated by a distinct subset of vertices from C, is called an iden...
PPOPP
2012
ACM
12 years 4 months ago
2012
ACM
Speedups demonstrated for finding the biconnected components of a graph: 9x to 33x on the Explicit Multi-Threading (XMT) many-core computing platform relative to the best serial ...
WETICE
2007
IEEE
14 years 2 months ago
2007
IEEE
Designing a collaborative architecture for real-time applications is an intricate challenge that usually involves dealing with the real-time constraints, resource limitations and ...
DM
2008
13 years 8 months ago
2008
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...
CORR
2008
Springer
13 years 8 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...