3958 search results - page 149 / 792 » Dynamic Graph Algorithms with Applications |
132
click to vote
JCT
2008
15 years 6 months ago
2008
Abstract. The study of graph vertex colorability from an algebraic perspective has introduced novel techniques and algorithms into the field. For instance, it is known that k-color...
150
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
157
Voted
ICCS
2009
Springer
16 years 28 days ago
2009
Springer
Reformulating an algorithm to mask communication delays is crucial in maintaining scalability, but traditional solutions embed the overlap strategy into the application. We present...
155
click to vote
AINA
2010
IEEE
15 years 11 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
188
click to vote
WABI
2009
Springer
16 years 29 days ago
2009
Springer
Comparative analysis of biomolecular networks constructed using measurements from different conditions, tissues, and organisms offer a powerful approach to understanding the stru...