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

DOI10.1016/J.IPL.2009.06.011zbMATH Open1202.68478OpenAlexW1993343925MaRDI QIDQ989571FDOQ989571

Authors: B. S. Panda, Sajal K. Das 

Publication date: 20 August 2010

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

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.06.011

Recommendations

• scientific article; zbMATH DE number 1955841
• A linear time recognition algorithm for proper interval graphs
• scientific article; zbMATH DE number 3892606
• Recognizing and representing proper interval graphs in parallel using merging and sorting
• scientific article; zbMATH DE number 123468

zbMATH Keywords

graph algorithmschordal graphsparallel algorithmsproper interval graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding Hamiltonian circuits in proper interval graphs
• Intersection graphs of paths in a tree
• Incidence matrices and interval graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Representations of chordal graphs as subtrees of a tree
• On the Desirability of Acyclic Database Schemes
• Scheduling Interval-Ordered Tasks
• Parallel Merge Sort
• Title not available (Why is that?)
• Counting clique trees and computing perfect elimination schemes in parallel
• A characterisation of rigid circuit graphs
• A linear time recognition algorithm for proper interval graphs
• Title not available (Why is that?)
• Efficient Parallel Algorithms for Chordal Graphs
• Polynomially bounded algorithms for locatingp-centers on a tree
• Some parallel algorithms on interval graphs
• New sequential and parallel algorithms for interval graph recognition
• Optimal parallel algorithms for finding cut vertices and bridges of interval graphs
• Title not available (Why is that?)

Cited In (5)

• Block-indifference graphs: characterization, structural and spectral properties
• Title not available (Why is that?)
• Non-inclusion and other subclasses of chordal graphs
• Counting and enumerating unlabeled split-indifference graphs
• Semi-proper interval graphs

This page was built for publication: A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs

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