686 search results - page 95 / 138 » Packing Cycles in Graphs |
100
Voted
DM
2010
14 years 7 months ago
2010
An octagon quadrangle is the graph consisting of an 8-cycle (x1, x2, ..., x8) with two additional chords: the edges {x1, x4} and {x5, x8}. An octagon quadrangle system of order v ...
111
Voted
AAAI
2012
13 years 3 months ago
2012
In many dynamic matching applications—especially high-stakes ones—the competitive ratios of prior-free online algorithms are unacceptably poor. The algorithm should take distr...
106
click to vote
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
121
Voted
ALGORITHMICA
2007
15 years 23 days ago
2007
In this paper we study the problems of detecting holes and antiholes in general undirected graphs, and we present algorithms for these problems. For an input graph G on n vertices ...
114
Voted
CMOT
2004
15 years 15 days ago
2004
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...