Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs

Haim Kaplan, Yahav Nussbaum

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We give two new algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs. The algorithms either provide a model for the input graph, or a certificate that proves that such a model does not exist and can be authenticated in O(n) time.

Original languageEnglish
Title of host publicationGraph-Theoretic Concepts in Computer Science - 32nd International Workshop, WG 2006, Revised Papers
PublisherSpringer Verlag
Pages289-300
Number of pages12
ISBN (Print)3540483810, 9783540483816
DOIs
StatePublished - 2006
Event32nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2006 - Bergen, Norway
Duration: 22 Jun 200624 Jun 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4271 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference32nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2006
Country/TerritoryNorway
CityBergen
Period22/06/0624/06/06

Fingerprint

Dive into the research topics of 'Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs'. Together they form a unique fingerprint.

Cite this