The Maximum Labeled Path Problem

DOI10.1007/978-3-319-12340-0_13MaRDI QIDQ2945186zbMATH OpenOpenAlexFDO

Authors Basile Couëtoux, Elie Nakache, Yann Vaxès

Publication date 9 September 2015

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-12340-0_13

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• The maximum labeled path problem
• The labeled maximum matching problem
• scientific article; zbMATH DE number 4021183
• The Maximum Solution Problem on Graphs
• Maximum path digraphs
• The maximum edge-disjoint paths problem in complete graphs
• The Maximum Disjoint Routing Problem
• scientific article; zbMATH DE number 1062936
• The label cut problem with respect to path length and label frequency
• Path Problems in Structured Graphs

Cited in

(1)

• The maximum labeled path problem

This page was built for publication: The Maximum Labeled Path Problem

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