Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14718
For citation please use:
Main Title: Recognizing Graphs without Asteroidal Triples
Author(s): Köhler, Ekkehard
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15945
http://dx.doi.org/10.14279/depositonce-14718
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: We consider the problem of recognizing AT-free graphs. Although there is a simple O(n3) algorithm, no faster method for solving this problem had been known. Here we give three different algorithms which have a better time complexity for graphs which are sparse or have a sparse complement; in particular we give algorithms which recognize AT-free graphs in O(n m} + n2), O( m}3/2 + n2), and O(n2.82 + n m). In addition we give a new characterization of graphs with bounded asteroidal number by the help of the knotting graph, a combinatorial structure which was introduced by Gallai for considering comparability graphs.
Subject(s): graph
algorithm
asteroidal triple-free
AT-free
recognition
Issue Date: 2000
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2000, 705
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-705-2000.pdf
Format: Adobe PDF | Size: 320.38 kB
DownloadShow Preview
Thumbnail
Report-705-2000.ps.gz
Format: Unknown | Size: 133.7 kB
Download

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.