1493 search results - page 202 / 299 » Local resilience of graphs |
107
Voted
WWW
2011
ACM
14 years 7 months ago
2011
ACM
Most Semantic Web data visualization tools structure the representation according to the concept definitions and interrelations that constitute the ontology’s vocabulary. Insta...
170
click to vote
PODC
2011
ACM
14 years 3 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
259
Voted
EMMCVPR
2011
Springer
14 years 14 days ago
2011
Springer
Abstract. The Mumford-Shah model has been one of the most powerful models in image segmentation and denoising. The optimization of the multiphase Mumford-Shah energy functional has...
107
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
2008
IEEE
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
93
Voted
GECCO
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...