774 search results - page 42 / 155 » A New Graph Triconnectivity Algorithm and Its Parallelizatio... |
118
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
103
click to vote
ICS
2010
Tsinghua U.
15 years 11 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
CVPR
2010
IEEE
15 years 9 months ago
2010
IEEE
Graph-cuts optimization is prevalent in vision and graphics problems. It is thus of great practical importance to parallelize the graph-cuts optimization using today’s ubiquitou...
112
click to vote
NPC
2004
Springer
15 years 6 months ago
2004
Springer
The complexity of services and applications provided by Web sites is ever increasing as integration of traditional Web publishing sites with new paradigms, i.e., e-commerce. Each d...
113
click to vote
BMCBI
2008
15 years 1 months ago
2008
Background: Graphs and networks are common analysis representations for biological systems. Many traditional graph algorithms such as k-clique, k-coloring, and subgraph matching h...