Graph Classes based on Interval Structures: Combinatorial Optimization and Recognition of Graph Classes with Applications to Related Models - Softcover
Synopsis
Interval structures arise naturally in many applications, as in genetics, molecular biology, resource allocation, and scheduling, among others. Such structures are often modeled with graphs, such as interval and tolerance graphs, which have been widely studied. In this book we mainly investigate these classes of graphs, as well as a scheduling problem. We present solutions to some open problems, along with some new representation models that enable the design of new efficient algorithms. In the context of interval graphs, we present the first polynomial algorithm for the longest path problem, whose complexity status was an open question. Furthermore, we introduce two matrix representations for both interval and proper interval graphs, which can be used to derive efficient algorithms. In the context of tolerance graphs, we present the first non-trivial intersection model, given by three-dimensional parallelepipeds, which enables the design of efficient algorithms for some NP-hard optimization problems. Furthermore, we prove that both recognition problems for tolerance and bounded tolerance graphs are NP-complete, thereby settling a long standing open question since 1982.
"synopsis" may belong to another edition of this title.
About the Author
George Mertzios, born in Greece (1983), has studied Applied Mathematics and Informatics at the National Technical Univ. of Athens and the Technische Univ. München. In 2009 he received his Ph.D. on Computer Science at the RWTH Aachen University. During his school years he received the Gold Medal at the 2nd Junior Balkan Mathematical Olympiad (1998).
"About this title" may belong to another edition of this title.
Search results for Graph Classes based on Interval Structures: Combinatorial...
Seller Image
Graph Classes based on Interval Structures
Published by
Südwestdeutscher Verlag Für Hochschulschriften AG Co. KG Okt 2015, 2015
ISBN 10: 3838111958
ISBN 13: 9783838111957
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Interval structures arise naturally in many applications, as in genetics, molecular biology, resource allocation, and scheduling, among others. Such structures are often modeled with graphs, such as interval and tolerance graphs, which have been widely studied. In this book we mainly investigate these classes of graphs, as well as a scheduling problem. We present solutions to some open problems, along with some new representation models that enable the design of new efficient algorithms. In the context of interval graphs, we present the first polynomial algorithm for the longest path problem, whose complexity status was an open question. Furthermore, we introduce two matrix representations for both interval and proper interval graphs, which can be used to derive efficient algorithms. In the context of tolerance graphs, we present the first non-trivial intersection model, given by three-dimensional parallelepipeds, which enables the design of efficient algorithms for some NP-hard optimization problems. Furthermore, we prove that both recognition problems for tolerance and bounded tolerance graphs are NP-complete, thereby settling a long standing open question since 1982. 164 pp. Englisch. Seller Inventory # 9783838111957
Buy New
US$ 94.40
US$ 26.38 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available
Seller Image
Graph Classes based on Interval Structures
Published by
Südwestdeutscher Verlag für Hochschulschriften, 2010
ISBN 10: 3838111958
ISBN 13: 9783838111957
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Mertzios George B.George Mertzios, born in Greece (1983), has studied AppliedMathematics and Informatics at the National Technical Univ. ofAthens and the Technische Univ. Muenchen. In 2009 he received hisPh.D. on Computer Science at t. Seller Inventory # 5405573
Buy New
US$ 75.71
US$ 56.19 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
Graph Classes based on Interval Structures | Combinatorial Optimization and Recognition of Graph Classes with Applications to Related Models
Published by
Südwestdeutscher Verlag für Hochschulschriften, 2015
ISBN 10: 3838111958
ISBN 13: 9783838111957
New
Taschenbuch
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Graph Classes based on Interval Structures | Combinatorial Optimization and Recognition of Graph Classes with Applications to Related Models | George B. Mertzios | Taschenbuch | 164 S. | Englisch | 2015 | Südwestdeutscher Verlag für Hochschulschriften | EAN 9783838111957 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Seller Inventory # 101285392
Buy New
US$ 79.39
US$ 80.29 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 5 available
Seller Image
Graph Classes based on Interval Structures
Published by
Südwestdeutscher Verlag Für Hochschulschriften Mär 2010, 2010
ISBN 10: 3838111958
ISBN 13: 9783838111957
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Interval structures arise naturally in many applications, as in genetics, molecular biology, resource allocation, and scheduling, among others. Such structures are often modeled with graphs, such as interval and tolerance graphs, which have been widely studied. In this book we mainly investigate these classes of graphs, as well as a scheduling problem. We present solutions to some open problems, along with some new representation models that enable the design of new efficient algorithms. In the context of interval graphs, we present the first polynomial algorithm for the longest path problem, whose complexity status was an open question. Furthermore, we introduce two matrix representations for both interval and proper interval graphs, which can be used to derive efficient algorithms. In the context of tolerance graphs, we present the first non-trivial intersection model, given by three-dimensional parallelepipeds, which enables the design of efficient algorithms for some NP-hard optimization problems. Furthermore, we prove that both recognition problems for tolerance and bounded tolerance graphs are NP-complete, thereby settling a long standing open question since 1982.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 164 pp. Englisch. Seller Inventory # 9783838111957
Buy New
US$ 94.40
US$ 68.82 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Seller Image
Graph Classes based on Interval Structures : Combinatorial Optimization and Recognition of Graph Classes with Applications to Related Models
Published by
Südwestdeutscher Verlag Für Hochschulschriften, 2010
ISBN 10: 3838111958
ISBN 13: 9783838111957
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Interval structures arise naturally in many applications, as in genetics, molecular biology, resource allocation, and scheduling, among others. Such structures are often modeled with graphs, such as interval and tolerance graphs, which have been widely studied. In this book we mainly investigate these classes of graphs, as well as a scheduling problem. We present solutions to some open problems, along with some new representation models that enable the design of new efficient algorithms. In the context of interval graphs, we present the first polynomial algorithm for the longest path problem, whose complexity status was an open question. Furthermore, we introduce two matrix representations for both interval and proper interval graphs, which can be used to derive efficient algorithms. In the context of tolerance graphs, we present the first non-trivial intersection model, given by three-dimensional parallelepipeds, which enables the design of efficient algorithms for some NP-hard optimization problems. Furthermore, we prove that both recognition problems for tolerance and bounded tolerance graphs are NP-complete, thereby settling a long standing open question since 1982. Seller Inventory # 9783838111957
Buy New
US$ 95.53
US$ 70.32 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available