1857 search results - page 1 / 372 » Minimum Degree Orderings |
IPPS
1999
IEEE
13 years 9 months ago
1999
IEEE
ALGORITHMICA
2010
13 years 2 months ago
2010
TCS
2008
13 years 5 months ago
2008
1 Elimination Game is a well known algorithm that simulates Gaussian elimination of matrices on graphs, and it computes a triangulation of the input graph. The number of fill edge...
APPML
2008
13 years 5 months ago
2008
Let G = (V, E) be a simple graph. A set D V is a dominating set of G if every vertex of V - D is adjacent to a vertex of D. The domination number of G, denoted by (G), is the min...
GC
2008
Springer
13 years 5 months ago
2008
Springer
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...