Interval graphs with side (and size) constraints
From MaRDI portal
Publication:6102297
DOI10.1007/3-540-60313-1_140zbMath1512.68246OpenAlexW1537974799MaRDI QIDQ6102297
Publication date: 8 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60313-1_140
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (3)
Dimension of restricted classes of interval orders ⋮ Satisfiability problems on intervals and unit intervals ⋮ Sampling dynamic networks with application to investigation of HIV epidemic drivers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maintaining knowledge about temporal intervals
- Bounded discrete representations of interval orders
- New scaling algorithms for the assignment and minimum mean cycle problems
- Temporally distributed symptoms in technical diagnosis
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Incidence matrices, interval graphs and seriation in archeology
- On a routing problem
- Classes of interval graphs under expanding length restrictions
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- Scheduling Interval-Ordered Tasks
- Khachiyan’s algorithm for linear programming
- Complexity and algorithms for reasoning about time
- Faster Scaling Algorithms for Network Problems
- Mapping the genome
- A Characterization of Comparability Graphs and of Interval Graphs
This page was built for publication: Interval graphs with side (and size) constraints
