641 search results - page 78 / 129 » On Planar Quasi-Parity Graphs |
DM
2010
14 years 12 months ago
2010
We investigate further the concept of asymptotic connectivity as defined previously by the first author. In particular, we compute an upper bound on the asymptotic connectivity of ...
JGT
2008
14 years 12 months ago
2008
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
101
click to vote
STOC
2004
ACM
16 years 5 days ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
AINA
2010
IEEE
15 years 4 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...
STOC
1994
ACM
15 years 4 months ago
1994
ACM