2283 search results - page 302 / 457 » Bounds of Graph Characteristics |
117
click to vote
CCCG
1997
15 years 4 months ago
1997
In this paper we prove that for any simple polygon P with n vertices, the sum of the number of strictly internal edges and the number of strictly external visibility edges of P is...
136
Voted
AI
2008
Springer
15 years 3 months ago
2008
Springer
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan leng...
127
Voted
AMAI
2005
Springer
15 years 3 months ago
2005
Springer
A CNF formula is called matched if its associated bipartite graph (whose vertices are clauses and variables) has a matching that covers all clauses. Matched CNF formulas are satisf...
154
click to vote
ALGORITHMICA
1998
15 years 3 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
144
Voted
SIAMDM
2010
15 years 1 months ago
2010
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...