Spanning tree of a multiple graph

DOI10.1007/S10878-021-00810-5zbMATH Open1492.90156OpenAlexW3203586695MaRDI QIDQ2136168FDOQ2136168

Yanyan Li

Publication date: 10 May 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-021-00810-5

zbMATH Keywords

minimum spanning treespanning treemultiple graphcomplete spanning treemultiple tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Metagraphs and their applications.

Cited In (6)

• Title not available (Why is that?)
• Multitrees in random graphs
• How to use spanning trees to navigate in graphs
• The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph
• The algorithms for the Eulerian cycle and Eulerian trail problems for a multiple graph
• Spanning trees in multipartite geometric graphs

This page was built for publication: Spanning tree of a multiple graph

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