Path Hitting in Acyclic Graphs

DOI10.1007/11841036_51MaRDI QIDQ5449559zbMATH OpenOpenAlexFDO

Authors Ojas Parekh, Danny Segev

Publication date 11 March 2008

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

Full work available at URL https://doi.org/10.1007/11841036_51

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Recommendations

• Path hitting in acyclic graphs
• Demand hitting and covering of intervals
• On structural parameterizations of \textsc{Hitting Set}: hitting paths in graphs using 2-SAT
• On structural parameterizations of Hitting Set: hitting paths in graphs using 2-SAT
• Spider covers and their applications

Cited in

(6)

• Path hitting in acyclic graphs
• Demand hitting and covering of intervals
• scientific article; zbMATH DE number 509207 (Why is no real title available?)
• scientific article; zbMATH DE number 4183442 (Why is no real title available?)
• On structural parameterizations of \textsc{Hitting Set}: hitting paths in graphs using 2-SAT
• On structural parameterizations of Hitting Set: hitting paths in graphs using 2-SAT

This page was built for publication: Path Hitting in Acyclic Graphs

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