Efficient parallel recognition of some circular arc graphs. II
type: Item
instance of: scholarly article
title: Efficient parallel recognition of some circular arc graphs. II
zbMATH Open document ID: 0865.68092
DOI: 10.1007/BF02523192
author: Juan-Miguel Gracia
published in: Algorithmica
publication date: 1997-03-06T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 988121
zbMATH Keywords: proper circular arc graphs
zbMATH Keywords: parallel algorithm
MaRDI profile type: Publication
cites work: Q4028894
cites work: Optimal parallel time bounds for the maximum clique problem on intervals
cites work: Efficient parallel recognition of some circular arc graphs. I
cites work: Q4525749
cites work: Parallel recognition of the consecutive ones property with applications
cites work: Efficient parallel algorithms for bipartite permutation graphs
cites work: Incidence matrices and interval graphs
cites work: The Complexity of Coloring Circular Arcs and Chords
cites work: Parallel recognition and decomposition of two terminal series parallel graphs
cites work: Q4385522
cites work: On a circle-cover minimization problem
cites work: Minimum Cuts for Circular-Arc Graphs
cites work: Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs
cites work: An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
cites work: An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs
cites work: An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs
cites work: Bipartite permutation graphs
cites work: Matrix characterizations of circular-arc graphs
full work available at URL: https://doi.org/10.1007/bf02523192
OpenAlex ID: W2088476807
description: scientific article; zbMATH DE number 988121