Colored constrained spanning tree on directed graphs

DOI10.1007/978-3-031-38906-1_37MaRDI QIDQ6139037

Hung-Yeh Lee, Wing-Kai Hon, Hsuan-Yu Liao

Publication date: 16 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

spanning treeNP-hardnessedge-colored graphcolored constraint

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Alternating cycles in edge-partitioned graphs
• A note on alternating cycles in edge-coloured graphs
• Wheeler graphs: a framework for BWT-based data structures
• Rainbow and properly colored spanning trees in edge-colored bipartite graphs
• Color degree sum conditions for properly colored spanning trees in edge-colored graphs
• Properly colored spanning trees in edge-colored graphs
• Maximum colored trees in edge-colored graphs
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
• Additive Guarantees for Degree-Bounded Directed Network Design
• Regular Languages meet Prefix Sorting

This page was built for publication: Colored constrained spanning tree on directed graphs