Sciweavers

3267 search results - page 323 / 654
» Generalized quasirandom graphs
Sort
View
GC
2007
Springer
15 years 6 months ago
Subdivision Extendibility
Let H be a multigraph and G a graph containing a subgraph isomorphic to a subdivision of H, with S ⊂ V (G) (the ground set) the image of V (H) under the isomorphism. We consider...
Ronald J. Gould, Thor Whalen
COMBINATORICS
1998
76views more  COMBINATORICS 1998»
15 years 6 months ago
An Exploration of the Permanent-Determinant Method
The permanent-determinant method and its generalization, the HafnianPfaffian method, are methods to enumerate perfect matchings of plane graphs that were discovered by P. W. Kaste...
Greg Kuperberg
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
16 years 7 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
IJAC
2010
96views more  IJAC 2010»
15 years 4 months ago
Coxeter Covers of the Classical Coxeter Groups
Let C(T) be a generalized Coxeter group, which has a natural map onto one of the classical Coxeter groups, either Bn or Dn. Let CY (T) be a natural quotient of C(T), and if C(T) is...
Meirav Amram, Robert Shwartz, Mina Teicher
STOC
2006
ACM
125views Algorithms» more  STOC 2006»
16 years 7 months ago
On earthmover distance, metric labeling, and 0-extension
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
Howard J. Karloff, Subhash Khot, Aranyak Mehta, Yu...