Nearly complete graphs decomposable into large induced matchings and their applications
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Noga Alon, Ankur Moitra, Benny Sudakov
Nearly complete graphs decomposable into large induced matchings and their applications
STOC, 2012.

STOC 2012
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{STOC-2012-AlonMS,
	author        = "Noga Alon and Ankur Moitra and Benny Sudakov",
	booktitle     = "{Proceedings of the 44th Annual ACM Symposium on Theory of Computing}",
	doi           = "10.1145/2213977.2214074",
	isbn          = "978-1-4503-1245-5",
	pages         = "1079--1090",
	publisher     = "{ACM}",
	title         = "{Nearly complete graphs decomposable into large induced matchings and their applications}",
	year          = 2012,
}

Tags:



Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.