4865 search results - page 700 / 973 » The Complexity of Graph Connectivity |
132
click to vote
IWPC
2002
IEEE
15 years 9 months ago
2002
IEEE
Program understanding tools manipulate program represensuch as abstract syntax trees, control-flow graphs, or data-flow graphs. This paper deals with the use of visitor combinat...
189
click to vote
METRICS
2002
IEEE
15 years 9 months ago
2002
IEEE
Maintaining software systems is getting more complex and difficult task, as the scale becomes larger. It is generally said that code clone is one of the factors that make softwar...
182
click to vote
SPAA
2010
ACM
15 years 9 months ago
2010
ACM
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
143
click to vote
EMMCVPR
2001
Springer
15 years 9 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...
136
click to vote
WADS
2001
Springer
15 years 9 months ago
2001
Springer
Methods for ranking World Wide Web resources according to their position in the link structure of the Web are receiving considerable attention, because they provide the first e...