Reconstruction of interval graphs
type: Item
instance of: scholarly article
title: Reconstruction of interval graphs
zbMATH Open document ID: 1198.05114
author: Masashi Kiyomi
author: Toshiki Saitoh
author: Ryuhei Uehara
published in: Theoretical Computer Science
publication date: 2010-11-11T00:00:00Z
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5815227
zbMATH Keywords: graph reconstruction conjecture
zbMATH Keywords: interval graphs
zbMATH Keywords: polynomial time algorithm
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.07.006
OpenAlex ID: W2087050979
cites work: Almost every graph has reconstruction number three
cites work: Q3975132
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Incidence matrices and interval graphs
cites work: Q4044629
cites work: Complexity results in graph reconstruction
cites work: A congruence theorem for trees
cites work: Reconstruction of Interval Graphs
cites work: Reconstruction Algorithm for Permutation Graphs
cites work: An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
cites work: On the complexity of graph reconstruction
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: A Linear Time Algorithm for Deciding Interval Graph Isomorphism
cites work: Reconstructibility and perfect graphs
cites work: ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES
DOI: 10.1016/J.TCS.2010.07.006
description: scientific article; zbMATH DE number 5815227