133 search results - page 22 / 27 » Subgraphs with restricted degrees of their vertices in plana... |
COMBINATORICS
2007
13 years 8 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
ALGORITHMICA
2004
13 years 8 months ago
2004
Abstract. We present an O(n log n)-time algorithm to solve the threedimensional layers-of-maxima problem, an improvement over the prior O(n log n log log n)-time solution. A previo...
JAIR
1998
13 years 8 months ago
1998
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...