Algorithms to Compute Minimum Cycle Basis in Directed Graphs

Author： Kavitha Telikepalli  

Publisher： Springer Publishing Company

ISSN： 1432-4350

Source： Theory of Computing Systems, Vol.40, Iss.4, 2007-06, pp. : 485-505

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Cycle decompositions IV: complete directed graphs and fixed length directed cycles

By Alspach B.   Gavlas H.   Sajna M.   Verrall H.  

Journal of Combinatorial Theory, Series A, Vol. 103, Iss. 1, 2003-07 ,pp. : 165-208

Elsevier

Access to resources Recommend Favorite

Algebraic connectivity of directed graphs

By Wu Chai Wah  

Linear and Multilinear Algebra, Vol. 53, Iss. 3, 2005-06 ,pp. : 203-223

Taylor & Francis Ltd

Access to resources Recommend Favorite

Bounds on minimum semidefinite rank of graphs

By  

Linear and Multilinear Algebra, Vol. 63, Iss. 4, 2015-04 ,pp. : 774-787

Taylor & Francis Ltd

Access to resources Recommend Favorite

Saturated Graphs of Prescribed Minimum Degree

By  

Combinatorics, Probability & Computing, Vol. 26, Iss. 2, 2017-03 ,pp. : 201-207

Cambridge University Press

Access to resources Recommend Favorite

ON CYCLE-SUPERMAGICNESS OF SUBDIVIDED GRAPHS

By  

Bulletin of the Australian Mathematical Society, Vol. 92, Iss. 1, 2015-08 ,pp. : 11-18

Cambridge University Press

Access to resources Recommend Favorite