144 search results - page 18 / 29 » Path extendability of claw-free graphs |
121
click to vote
COR
2008
14 years 9 months ago
2008
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
CORR
2006
Springer
14 years 9 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...
WETICE
1996
IEEE
15 years 1 months ago
1996
IEEE
The Multi-Head, Multi-Tail, Multi-Client (MMM) Browsing Project is a continuing effort to bring stronger graph semantics to the World Wide Web thereby increasing the Web's us...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
DATE
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...