Colored constrained spanning tree on directed graphs

DOI10.1007/978-3-031-38906-1_37MaRDI QIDQ6139037zbMATH OpenFDO

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

Publication date 16 January 2024

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

zbMATH Keywords

edge-colored graphNP-hardnessspanning treecolored constraint

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
• A note on alternating cycles in edge-coloured graphs
• Additive guarantees for degree-bounded directed network design
• Alternating cycles in edge-partitioned graphs
• Color degree sum conditions for properly colored spanning trees in edge-colored graphs
• Introduction to algorithms.
• Maximum colored trees in edge-colored graphs
• Properly colored spanning trees in edge-colored graphs
• Rainbow and properly colored spanning trees in edge-colored bipartite graphs
• Regular Languages meet Prefix Sorting
• Wheeler graphs: a framework for BWT-based data structures

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

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