1952 search results - page 229 / 391 » Complete partitions of graphs |
193
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
We give a simple framework which is an alternative to the celebrated and widely used shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms ...
169
click to vote
COCOON
2003
Springer
15 years 11 months ago
2003
Springer
The relationship between graph coloring and the immersion order is considered. Vertex connectivity, edge connectivity and related issues are explored. These lead to the conjecture...
132
click to vote
ACL
2006
15 years 8 months ago
2006
We present an algorithm which creates a German CCGbank by translating the syntax graphs in the German Tiger corpus into CCG derivation trees. The resulting corpus contains 46,628 ...
146
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
189
click to vote
ALGORITHMICA
2004
15 years 6 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...