Title of article
The real truth about star designs Original Research Article
Author/Authors
D.G. Hoffman، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
4
From page
177
To page
180
Abstract
Determining whether the edges of an input graph G can be partitioned into k-stars is NP-complete. However, with some extra information, we can convert this to a flow problem, giving both a polynomial algorithm, and a strong theoretical tool.
Keywords
Network flows , Graph designs
Journal title
Discrete Mathematics
Serial Year
2004
Journal title
Discrete Mathematics
Record number
948963
Link To Document