668 search results - page 21 / 134 » Algorithmics and Applications of Tree and Graph Searching |
101
Voted
GD
2003
Springer
15 years 7 months ago
2003
Springer
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
141
click to vote
ISAAC
2009
Springer
15 years 8 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
IPL
2006
15 years 1 months ago
2006
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k...
126
click to vote
CNSR
2007
IEEE
15 years 5 months ago
2007
IEEE
Search engines have turned into one of the most important services of the Web that are frequently visited by any user. They assist their users in finding appropriate information. ...
111
click to vote
DISOPT
2008
15 years 2 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...