59 search results - page 5 / 12 » Odd Cycle Packing |
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
The parallel repetition theorem states that for any two-prover game, with value 1 − (for, say, ≤ 1/2), the value of the game repeated in parallel n times is at most (1 − c)â...
SIAMDM
2008
14 years 9 months ago
2008
A graph G is strict quasi parity (SQP) if every induced subgraph of G that is not a clique contains a pair of vertices with no odd chordless path between them (an even pair). Houga...
DAM
2008
14 years 9 months ago
2008
For each constant k, we present a linear time algorithm that, given a planar graph G, either finds a minimum odd cycle vertex transversal in G or guarantees that there is no transv...
106
Voted
CORR
2004
Springer
14 years 9 months ago
2004
Springer
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
CSB
2005
IEEE
15 years 3 months ago
2005
IEEE
Human crooked neck protein (hcrn) containing 17 HAT or TPR repeats plays a role in pre-mRNA processing. Conserved residues in the TPR consensus sequence of 34 aa were found at hel...