DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click
HERE to register or log in.
Accession Number:
AD0701309
Title:
ON BOUNDS FOR COMPLEMENTARY TREES IN A GRAPH
Corporate Author:
STANFORD UNIV CA OPERATIONS RESEARCH HOUSE
Report Date:
1969-12-01
Abstract:
It was shown elsewhere by Dantzig that if there exits one complementary tree in the undirected network GG epsilon etan then there exists at least two. The proof there is by means of an algorithm which finds a different complementary tree from a given one. It is shown in this paper that using an extended form of Dantzigs algorithm can lead to a stronger result if there exists one complementary tree in GG epsilon etan then there exists at least four. Also some examples are provided to establish an upper bound on the smallest number of complementary trees in a network GG epsilon etan which has at least one complementary tree.
Descriptive Note:
Technical rept.
Supplementary Note:
Sponsored in part by Contract AT(04-3)-326, Grant NSF-GP- 6431. DOI: 10.21236/AD0701309
Pages:
0014
Distribution Statement:
Approved for public release; distribution is unlimited.
Contract Number:
N00014-67-A-0112-0011
Contract Number 2:
DAHC04-67-C-0028
File Size:
1.36MB
