1447 search results - page 62 / 290 » Graphs and Path Equilibria |
154
Voted
CIAC
2010
Springer
15 years 7 months ago
2010
Springer
We investigate the relationship between two kinds of vertex colorings of graphs: uniquemaximum colorings and conflict-free colorings. In a unique-maximum coloring, the colors are ...
125
click to vote
SAC
2004
ACM
15 years 9 months ago
2004
ACM
In recent years, researchers in graph mining have been exploring linear paths as well as subgraphs as pattern languages. In this paper, we are investigating the middle ground betw...
128
Voted
SOFSEM
2009
Springer
16 years 22 days ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
125
click to vote
WG
1997
Springer
15 years 8 months ago
1997
Springer
In this paper we present a parallel algorithm that decides whether a graph G has treewidth at most two, and if so, construct a tree decomposition or path decomposition of minimum ...
126
click to vote
IPL
2006
15 years 3 months ago
2006
An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality ...