1857 search results - page 81 / 372 » Minimum Degree Orderings |
179
click to vote
JGAA
2006
15 years 6 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
134
click to vote
JC
2006
15 years 6 months ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
186
click to vote
WAOA
2007
Springer
16 years 16 days ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
138
click to vote
ECIS
2001
15 years 7 months ago
2001
This paper analyzes an optimal differentiation between two competing application software products when one of the two is produced by a monopolist of a base software. The so calle...
147
click to vote
DM
2010
15 years 6 months ago
2010
A card of a graph G is a subgraph formed by deleting one vertex. The Reconstruction Conjecture states that each graph with at least three vertices is determined by its multiset of...