Graph classes based interval di mertzios george (5 risultati)
Lingua: Inglese
Editore: Südwestdeutscher Verlag für Hochschulschriften, 2015
- Brossura
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 67,20
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: 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.
Lingua: Inglese
Editore: Südwestdeutscher Verlag Für Hochschulschriften AG Co. KG Okt 2015, 2015
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 79,90
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: 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, w…hich 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.
Lingua: Inglese
Editore: Südwestdeutscher Verlag für Hochschulschriften, 2010
- Brossura
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 64,09
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: 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.
Lingua: Inglese
Editore: Südwestdeutscher Verlag Für Hochschulschriften Mär 2010, 2010
- Brossura
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 79,90
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: 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.
Lingua: Inglese
Editore: Südwestdeutscher Verlag Für Hochschulschriften, 2010
- Brossura
- Print on Demand
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 80,86
EUR 61,31 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: 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.
