3105 search results - page 240 / 621 » The Path-Packing Structure of Graphs |
OOPSLA
2005
Springer
15 years 9 months ago
2005
Springer
This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation with distributed memory. The BGL consists of a rich set of generic graph algor...
121
Voted
COLT
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
132
click to vote
ISSS
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper concerns automatic hardware synthesis from data flow graph (DFG) specification in system level design. In the presented design methodology, each node of a data flow gra...
126
click to vote
ESWS
2008
Springer
15 years 5 months ago
2008
Springer
A fundamental problem related to graph structured databases is searching for substructures. One issue with respect to optimizing such searches is the ability to estimate the freque...
131
click to vote
FLAIRS
2004
15 years 5 months ago
2004
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...