Nearly complete graphs decomposable into large induced matchings and their applications
Authors:
Open Access
- 19 May 2012
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1079-1090
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- On An Extremal Hypergraph Problem Of Brown, Erdős And SósCombinatorica, 2006
- Testing subgraphs in directed graphsJournal of Computer and System Sciences, 2004
- Simple analysis of graph tests for linearity and PCPRandom Structures & Algorithms, 2003
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree ProblemJournal of Algorithms, 2000
- Approximation Algorithms for Directed Steiner ProblemsJournal of Algorithms, 1999
- Representing Boolean functions as polynomials modulo composite numberscomputational complexity, 1994
- Self-testing/correcting with applications to numerical problemsJournal of Computer and System Sciences, 1993
- On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannelsIEEE Transactions on Information Theory, 1993
- The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponentGraphs and Combinatorics, 1986
- On the existence of triangulated spheres in 3-graphs, and related problemsPeriodica Mathematica Hungarica, 1973