87 search results - page 13 / 18 » A Faster Algorithm for Minimum Cycle Basis of Graphs |
106
Voted
DATE
2008
IEEE
15 years 9 months ago
2008
IEEE
Synchronous Data Flow Graphs (SDFGs) have proved to be a very successful tool for modeling, analysis and synthesis of multimedia applications targeted at both single- and multiproc...
126
Voted
TAMC
2010
Springer
15 years 29 days ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
120
click to vote
EMMCVPR
2001
Springer
15 years 7 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
96
Voted
ISNN
2004
Springer
15 years 8 months ago
2004
Springer
A reliable correlation between rainfall-runoff enables the local authority to gain more amble time for formulation of appropriate decision making, issuance of an advanced flood for...
148
Voted
KDD
2008
ACM
16 years 3 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...