Articoli correlati a On Three Graph Layout Problems
Sinossi
The bandwidth minimization problem for graphs was first stated in 1966 by Harper, where the problem was solved for hypercubes. Finding the bandwidth of an arbitrary graph is an NP-complete problem and it remains NP-complete for many simple structures, e.g. for cyclic caterpillars with hair length at most 1, graphs in which the removal of all pendant vertices results in a simple cycle. There are only few classes of graphs for which an efficient solution to the bandwidth problem is known. Classes of graphs whose bandwidth can be computed efficiently are butterflies, chain graphs, caterpillars with hair length at most 2. Another nontrivial class, for which the problem was solved efficiently, is the class of interval graphs, graphs which are the intersection graphs of a family of intervals over the real line. The first polynomial algorithm for interval graphs was given in 1986 by the author. It was published in the Reports of NAS RA, where the algorithm is described in detail, and besides a brief proof of its correctness is done. Since this result was independently obtained and published earlier we consider reasonable publishing the full proof of our algorithm’s correctness.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Risultati della ricerca per On Three Graph Layout Problems
Immagini fornite dal venditore
On Three Graph Layout Problems
Editore:
LAP LAMBERT Academic Publishing Feb 2018, 2018
ISBN 10: 6202053852
ISBN 13: 9786202053853
Nuovo
Taschenbuch
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The bandwidth minimization problem for graphs was first stated in 1966 by Harper, where the problem was solved for hypercubes. Finding the bandwidth of an arbitrary graph is an NP-complete problem and it remains NP-complete for many simple structures, e.g. for cyclic caterpillars with hair length at most 1, graphs in which the removal of all pendant vertices results in a simple cycle. There are only few classes of graphs for which an efficient solution to the bandwidth problem is known. Classes of graphs whose bandwidth can be computed efficiently are butterflies, chain graphs, caterpillars with hair length at most 2. Another nontrivial class, for which the problem was solved efficiently, is the class of interval graphs, graphs which are the intersection graphs of a family of intervals over the real line. The first polynomial algorithm for interval graphs was given in 1986 by the author. It was published in the Reports of NAS RA, where the algorithm is described in detail, and besides a brief proof of its correctness is done. Since this result was independently obtained and published earlier we consider reasonable publishing the full proof of our algorithm's correctness. 64 pp. Englisch. Codice articolo 9786202053853
Compra nuovo
EUR 28,90
Spedizione EUR 23,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Foto dell'editore
On Three Graph Layout Problems
Editore:
LAP LAMBERT Academic Publishing, 2018
ISBN 10: 6202053852
ISBN 13: 9786202053853
Nuovo
Paperback
Da: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Paperback. Condizione: Brand New. 64 pages. 8.66x5.91x0.15 inches. In Stock. Codice articolo zk6202053852
Compra nuovo
EUR 50,21
Spedizione EUR 11,69
Spedito da Regno Unito a U.S.A.
Spedito da Regno Unito a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
On Three Graph Layout Problems
Editore:
LAP LAMBERT Academic Publishing, 2018
ISBN 10: 6202053852
ISBN 13: 9786202053853
Nuovo
Brossura
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Muradian DavidDavid Muradian is a discrete mathematics specialist from Armenia. His primary area of expertise is graph theory, focused on graph layout problems. Most of results outlined in this publication where produced at the Insti. Codice articolo 385923388
Compra nuovo
EUR 26,05
Spedizione EUR 48,99
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
On Three Graph Layout Problems
Editore:
LAP LAMBERT Academic Publishing Feb 2018, 2018
ISBN 10: 6202053852
ISBN 13: 9786202053853
Nuovo
Taschenbuch
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -The bandwidth minimization problem for graphs was first stated in 1966 by Harper, where the problem was solved for hypercubes. Finding the bandwidth of an arbitrary graph is an NP-complete problem and it remains NP-complete for many simple structures, e.g. for cyclic caterpillars with hair length at most 1, graphs in which the removal of all pendant vertices results in a simple cycle. There are only few classes of graphs for which an efficient solution to the bandwidth problem is known. Classes of graphs whose bandwidth can be computed efficiently are butterflies, chain graphs, caterpillars with hair length at most 2. Another nontrivial class, for which the problem was solved efficiently, is the class of interval graphs, graphs which are the intersection graphs of a family of intervals over the real line. The first polynomial algorithm for interval graphs was given in 1986 by the author. It was published in the Reports of NAS RA, where the algorithm is described in detail, and besides a brief proof of its correctness is done. Since this result was independently obtained and published earlier we consider reasonable publishing the full proof of our algorithm¿s correctness.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 64 pp. Englisch. Codice articolo 9786202053853
Compra nuovo
EUR 28,90
Spedizione EUR 60,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
On Three Graph Layout Problems
Editore:
LAP LAMBERT Academic Publishing, 2018
ISBN 10: 6202053852
ISBN 13: 9786202053853
Nuovo
Taschenbuch
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - The bandwidth minimization problem for graphs was first stated in 1966 by Harper, where the problem was solved for hypercubes. Finding the bandwidth of an arbitrary graph is an NP-complete problem and it remains NP-complete for many simple structures, e.g. for cyclic caterpillars with hair length at most 1, graphs in which the removal of all pendant vertices results in a simple cycle. There are only few classes of graphs for which an efficient solution to the bandwidth problem is known. Classes of graphs whose bandwidth can be computed efficiently are butterflies, chain graphs, caterpillars with hair length at most 2. Another nontrivial class, for which the problem was solved efficiently, is the class of interval graphs, graphs which are the intersection graphs of a family of intervals over the real line. The first polynomial algorithm for interval graphs was given in 1986 by the author. It was published in the Reports of NAS RA, where the algorithm is described in detail, and besides a brief proof of its correctness is done. Since this result was independently obtained and published earlier we consider reasonable publishing the full proof of our algorithm's correctness. Codice articolo 9786202053853
Compra nuovo
EUR 30,73
Spedizione EUR 60,57
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
On Three Graph Layout Problems
Editore:
LAP LAMBERT Academic Publishing, 2018
ISBN 10: 6202053852
ISBN 13: 9786202053853
Nuovo
Taschenbuch
Da: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Taschenbuch. Condizione: Neu. On Three Graph Layout Problems | David Muradian | Taschenbuch | 64 S. | Englisch | 2018 | LAP LAMBERT Academic Publishing | EAN 9786202053853 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu. Codice articolo 111324878
Compra nuovo
EUR 26,35
Spedizione EUR 70,00
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 5 disponibili