2446 search results - page 359 / 490 » Choiceless Polynomial Time |
DAM
2006
13 years 7 months ago
2006
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
COMBINATORICS
2007
13 years 7 months ago
2007
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...
COMBINATORICS
2007
13 years 7 months ago
2007
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
JMIV
2008
13 years 7 months ago
2008
Photographic outlines of 3 dimensional solids are robust and rich in information useful for surface reconstruction. This paper studies algebraic surfaces viewed from 2 cameras with...