3396 search results - page 67 / 680 » Tree representations of graphs |
WCRE
2000
IEEE
14 years 1 months ago
2000
IEEE
One of the most important issue in source code analysis and software re-engineering is the representation of ode text at an abstraction level and form suitable for algorithmic pro...
WDAG
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
MFCS
1995
Springer
14 years 12 days 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...
MFCS
2005
Springer
14 years 2 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...