Adobe PDF (1.51 MB)
Title Details:
Permutation 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, as well as a very good understanding of the properties of triangle-free graphs from Chapter 9 and interval graphs from Chapter 10. A strong understanding of data structures and advanced algorithmic techniques 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/2074
Bibliographic Reference: Nikolopoulos, S., Georgiadis, L., & Palios, L. (2015). Permutation Graphs [Chapter]. In Nikolopoulos, S., Georgiadis, L., & Palios, L. 2015. Algorithmic Graph Theory [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/2074
Language: Greek
Is Part of: Algorithmic Graph Theory
Number of pages 20
Publication Origin: Kallipos, Open Academic Editions