19 search results - page 3 / 4 » algorithmica 2011 |
ALGORITHMICA
2011
12 years 11 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
ALGORITHMICA
2011
12 years 11 months ago
2011
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
ALGORITHMICA
2011
12 years 11 months ago
2011
We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active ve...
ALGORITHMICA
2011
12 years 11 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...
ALGORITHMICA
2011
12 years 11 months ago
2011
We introduce the concept of knowledge states; many well-known algorithms can be viewed as knowledge state algorithms. The knowledge state approach can be used to to construct comp...