5607 search results - page 413 / 1122 » Graph structure in the Web |
154
click to vote
AE
2007
Springer
16 years 1 months ago
2007
Springer
The evaluation or fitness function is a key component of any heuristic search algorithm. This paper introduces a new evaluation function for the well-known graph K-coloring proble...
190
click to vote
GD
2005
Springer
16 years 12 days ago
2005
Springer
Widely varying node degrees occur in software dependency graphs, hyperlink structures, social networks, and many other real-world graphs. Finding dense subgraphs in such graphs is ...
144
click to vote
OOPSLA
2005
Springer
16 years 11 days 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...
168
click to vote
COLT
2004
Springer
16 years 8 days 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...
171
click to vote
ISSS
2000
IEEE
15 years 11 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...