A simpler linear-time recognition of circular-arc graphs (Q644807)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	A simpler linear-time recognition of circular-arc graphs	scientific article

Statements

scholarly article

A simpler linear-time recognition of circular-arc graphs (English)

publication date

7 November 2011

zbMATH Keywords

circular-arc graph

circular-arc model

recognition algorithm

intersection graph

consecutive-ones property

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1007/s00453-010-9432-y

Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Algorithms on circular-arc graphs

$O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs

PC trees and circular-ones arrangements.

A Simpler Linear-Time Recognition of Circular-Arc Graphs

Characterizations and Linear Time Recognition of Helly Circular-Arc Graphs

Linear-time recognition of circular-arc graphs

Modular decomposition and transitive orientation

Circular-arc graphs with clique cover number two

Efficient graph representations

Matrix characterizations of circular-arc graphs

An Efficient Test for Circular-Arc Graphs

Identifiers

Sitelinks

Mathematics(1 entry)

mardi Publication:644807

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q644807&oldid=39803414"