Construction of natural cycletrees

DOI10.1016/S0020-0190(96)00179-2zbMATH Open1336.05139OpenAlexW2062745474MaRDI QIDQ286963FDOQ286963

Margus Veanes, Jonas Barklund

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(96)00179-2

Recommendations

• Revised Greedy algorithm for formation of a minimal cycle basis of a graph
• scientific article; zbMATH DE number 4010557
• Minimal path length of trees with known fringe
• scientific article; zbMATH DE number 3891405
• A practical minimum spanning tree algorithm using the cycle property

zbMATH Keywords

binary treesHamiltonian cycles

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Paths and cycles (05C38)

Cites Work

• Title not available (Why is that?)

Cited In (1)

• Cycle action on treelike structures.

This page was built for publication: Construction of natural cycletrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286963)