Sequence hypergraphs

DOI10.1007/978-3-662-53536-3_24MaRDI QIDQ3181065zbMATH OpenOpenAlexFDO

Authors Kateřina Böhmová, J. Chalopin, Matúš Mihalák, Guido Proietti, Peter Widmayer

Publication date 22 December 2016

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-662-53536-3_24

zbMATH Keywords

algorithmscolored graphscomplexitylabeled problemsoriented hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Sequence Hypergraphs: Paths, Flows, and Cuts
• scientific article; zbMATH DE number 1222555
• Directed hypergraphs and applications
• scientific article; zbMATH DE number 4112412
• scientific article; zbMATH DE number 2044509

Cites work

• A generalization of rotational tournaments
• Approximation algorithms and hardness results for labeled connectivity problems
• Approximation and hardness results for label cut and related problems
• Combinatorial optimization in networks with shared risk link groups
• Computing and listing \(st\)-paths in public transportation networks
• Directed hypergraphs and applications
• Hamiltonian paths and cycles in hypertournaments
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2044509 (Why is no real title available?)
• scientific article; zbMATH DE number 2147947 (Why is no real title available?)
• scientific article; zbMATH DE number 1445322 (Why is no real title available?)
• Intersecting Sperner families and their convex hulls
• On the minimum label spanning tree problem
• Shortest Paths with Bundles and Non-additive Weights Is Hard
• The parameterized complexity of some minimum label problems
• Vertex cover might be hard to approximate to within \(2 - \varepsilon \)

Cited in

(3)

• scientific article; zbMATH DE number 3859160 (Why is no real title available?)
• Vertex sequences in graphs
• Sequence Hypergraphs: Paths, Flows, and Cuts

This page was built for publication: Sequence hypergraphs

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