New sequential and parallel algorithms for interval graph recognition

DOI10.1016/0020-0190(90)90163-RzbMath0711.68084MaRDI QIDQ922725

G. Ramalingam, C. Pandu Rangan

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

interval graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (1)

A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding Hamiltonian circuits in interval graphs
• Some parallel algorithms on interval graphs
• A unified approach to domination problems on interval graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The edge inducibility of graphs
• Total domination in interval graphs

This page was built for publication: New sequential and parallel algorithms for interval graph recognition