scientific article; zbMATH DE number 4049085
From MaRDI portal
Publication:3785976
zbMATH Open0643.68092MaRDI QIDQ3785976FDOQ3785976
Authors: Norbert Korte, Rolf H. Möhring 
Publication date: 1987
Title of this publication is not available (Why is that?)
Recommendations
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (18)
- An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
- On-line recognition of interval graphs in \(O(m+n \log n)\) time
- Simple linear time recognition of unit interval graphs
- Linear recognition of almost interval graphs
- A linear time recognition algorithm for proper interval graphs
- Computing the clique-separator graph for an interval graph in linear time
- Title not available (Why is that?)
- A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs
- Title not available (Why is that?)
- Strictly interval graphs: characterization and linear time recognition
- Recognition algorithm for intersection graphs of edge disjoint paths in a tree
- Title not available (Why is that?)
- Fast and simple algorithms to count the number of vertex covers in an interval graph
- A linear-time algorithm for proper interval graph recognition
- New sequential and parallel algorithms for interval graph recognition
- A polynomial time recognition algorithm for probe interval graphs
- A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns
- On finding Tucker submatrices and Lekkerkerker-Boland subgraphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3785976)
