An efficient algorithm for computing a minimum node cutset from a vertex-disjoint path set for timing optimization
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

Wing Ning Li
An efficient algorithm for computing a minimum node cutset from a vertex-disjoint path set for timing optimization
SAC, 1995.

SAC 1995
DBLP
Scholar
DOI
Full names Links ISxN
@inproceedings{SAC-1995-Li,
	author        = "Wing Ning Li",
	booktitle     = "{Proceedings of the 10th Symposium on Applied Computing}",
	doi           = "10.1145/315891.315904",
	pages         = "56--60",
	publisher     = "{ACM}",
	title         = "{An efficient algorithm for computing a minimum node cutset from a vertex-disjoint path set for timing optimization}",
	year          = 1995,
}

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.