216 search results - page 3 / 44 » Edge Search Number of Cographs in Linear Time |
NETWORKS
2010
13 years 4 months ago
2010
We show that the mixed search number and the linear-width of interval graphs and of split graphs can be computed in linear time and in polynomial time, respectively.
ALGORITHMICA
2011
13 years 1 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
CCCG
2004
13 years 7 months ago
2004
We study the problem of computing the set of all distant horizons of a terrain, represented as either: the set of all edges that appear in the set of all distant horizons; the con...
AAAI
1996
13 years 7 months ago
1996
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
IPL
2000
13 years 6 months ago
2000
Given a polyhedron P by a list of inequalities we develop unbiased estimates of the number of vertices and bases of P. The estimates are based on applying tree estimation methods ...