Recognizing d-interval graphs and d-track interval graphs

DOI10.1007/978-3-642-14553-7_17zbMATH Open1288.05278OpenAlexW1532677490MaRDI QIDQ3587347FDOQ3587347

Authors: Minghui Jiang 

Publication date: 7 September 2010

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14553-7_17

Recommendations

• Recognizing \(d\)-interval graphs and \(d\)-track interval graphs
• scientific article; zbMATH DE number 1185295
• Recognizing graphs with fixed interval number is NP-complete
• On interval representations of graphs
• On Restrictions of Balanced 2-Interval Graphs

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)

Cited In (11)

• On Restrictions of Balanced 2-Interval Graphs
• Recognizing graphs with fixed interval number is NP-complete
• Parameterized complexity in multiple-interval graphs: domination
• On the parameterized complexity of some optimization problems related to multiple-interval graphs
• Title not available (Why is that?)
• Recognizing unit multiple interval graphs is hard
• Edge-intersection graphs of grid paths: the bend-number
• Three ways to cover a graph
• RESTRICTED TRACK ASSIGNMENT WITH APPLICATIONS
• Recognizing \(d\)-interval graphs and \(d\)-track interval graphs
• Title not available (Why is that?)

This page was built for publication: Recognizing \(d\)-interval graphs and \(d\)-track interval graphs

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