2487 search results - page 101 / 498 » Partitions of Graphs into Trees |
TCS
2008
13 years 9 months ago
2008
In this paper, we consider two facility location problems on tree networks. One is the 2-radius problem, whose goal is to partition the vertex set of the given network into two no...
MFCS
1995
Springer
14 years 1 months ago
1995
Springer
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...
INFOVIS
2005
IEEE
14 years 3 months ago
2005
IEEE
We present PRISAD, the first generic rendering infrastructure for information visualization applications that use the accordion drawing technique: rubber-sheet navigation with gu...
MFCS
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
ISAAC
1998
Springer
14 years 1 months ago
1998
Springer
Let G = (V; E; w) be an undirected graph with nonnegative edge length function w and nonnegative vertex weight function r. The optimal product-requirement communication spanning t...