Adobe PDF (1.69 MB)
Title Details:
Comparability Graphs
Authors: Nikolopoulos, Stavros
Georgiadis, Loukas
Palios, Leonidas
Reviewer: Manolopoulos, Ioannis
Subject: MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > DISCRETE STRUCTURES
MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > ALGORITHMS AND COMPLEXITY
MATHEMATICS AND COMPUTER SCIENCE > COMPUTER SCIENCE > ALGORITHMS AND COMPLEXITY > FUNDAMENTAL DATA STRUCTURES AND ALGORITHMS
Description:
Abstract:
Prerequisite Knowledge: Very good understanding of the concepts and topics in Chapter 1 related to cut sets and perfect graphs. Similar to Chapter 9 on triangle-free graphs, here as well, the reader is encouraged to refer to the classic book by Martin C. Golumbic, "Algorithmic Graph Theory and Perfect Graphs," and study its introductory chapters as well as the corresponding chapter on interval graphs. A strong understanding of data structures and advanced algorithmic techniques, especially in directed graphs, is required to comprehend the topics of this chapter.
Technical Editors: Giannakeas, Nikolaos
Type: Chapter
Creation Date: 2015
Item Details:
License: http://creativecommons.org/licenses/by-nc-nd/3.0/gr
Handle http://hdl.handle.net/11419/2072
Bibliographic Reference: Nikolopoulos, S., Georgiadis, L., & Palios, L. (2015). Comparability Graphs [Chapter]. In Nikolopoulos, S., Georgiadis, L., & Palios, L. 2015. Algorithmic Graph Theory [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/2072
Language: Greek
Is Part of: Algorithmic Graph Theory
Number of pages 26
Publication Origin: Kallipos, Open Academic Editions