Min Cut is NP-Complete for Edge Weighted Trees
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

Burkhard Monien, Ivan Hal Sudborough
Min Cut is NP-Complete for Edge Weighted Trees
ICALP, 1986.

ICALP 1986
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{ICALP-1986-MonienS,
	author        = "Burkhard Monien and Ivan Hal Sudborough",
	booktitle     = "{Proceedings of the 13th International Colloquium on Automata, Languages and Programming}",
	doi           = "10.1007/3-540-16761-7_76",
	isbn          = "3-540-16761-7",
	pages         = "265--274",
	publisher     = "{Springer-Verlag}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Min Cut is NP-Complete for Edge Weighted Trees}",
	volume        = 226,
	year          = 1986,
}


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.