NotesFAQContact Us
Search Tips
ERIC Number: ED034683
Record Type: RIE
Publication Date: 1969-Mar
Pages: 17
Abstractor: N/A
Reference Count: 0
Minimum Covers of Fixed Cardinality in Weighted Graphs.
White, Lee J.
Reported is the result of research on combinatorial and algorithmic techniques for information processing. A method is discussed for obtaining minimum covers of specified cardinality from a given weighted graph. By the indicated method, it is shown that the family of minimum covers of varying cardinality is related to the minimum spanning tree of that graph. (RP)
Publication Type: N/A
Education Level: N/A
Audience: N/A
Language: N/A
Sponsor: National Science Foundation, Washington, DC.
Authoring Institution: Ohio State Univ., Columbus. Computer and Information Science Research Center.
Identifiers: N/A