Title : 
Minimum-length fundamental cycle set
         
        
        
        
        
        
            fDate : 
10/1/1979 12:00:00 AM
         
        
        
        
            Abstract : 
Significance of a spanning tree which yields a fundamental set of cycles with minimum total length is discussed. It is shown through a counter example that for this problem a locally optimal spanning tree need not be globally optimal, as conjectured earlier in the literature.
         
        
            Keywords : 
Graph theory; Circuits and systems; Computational complexity; Counting circuits; Data structures; Polynomials; Tree graphs;
         
        
        
            Journal_Title : 
Circuits and Systems, IEEE Transactions on
         
        
        
        
        
            DOI : 
10.1109/TCS.1979.1084563