Items related to On Three Graph Layout Problems
Synopsis
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.
"synopsis" may belong to another edition of this title.
About the Author
David 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 Institute for Informatics and Automation Problems of the National Academy of Sciences of the Republic of Armenia.
"About this title" may belong to another edition of this title.
Search results for On Three Graph Layout Problems
Seller Image
On Three Graph Layout Problems
Published by
LAP LAMBERT Academic Publishing Feb 2018, 2018
ISBN 10: 6202053852
ISBN 13: 9786202053853
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 -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. Seller Inventory # 9786202053853
Buy New
US$ 33.85
US$ 26.15 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 2 available
Stock Image
On Three Graph Layout Problems
Published by
LAP LAMBERT Academic Publishing, 2018
ISBN 10: 6202053852
ISBN 13: 9786202053853
New
Paperback
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. 64 pages. 8.66x5.91x0.15 inches. In Stock. Seller Inventory # zk6202053852
Buy New
US$ 57.08
US$ 13.29 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Seller Image
On Three Graph Layout Problems
Published by
LAP LAMBERT Academic Publishing, 2018
ISBN 10: 6202053852
ISBN 13: 9786202053853
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: 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. Seller Inventory # 385923388
Buy New
US$ 30.50
US$ 55.70 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
On Three Graph Layout Problems
Published by
LAP LAMBERT Academic Publishing Feb 2018, 2018
ISBN 10: 6202053852
ISBN 13: 9786202053853
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 -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. Seller Inventory # 9786202053853
Buy New
US$ 33.85
US$ 68.21 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Seller Image
On Three Graph Layout Problems
Published by
LAP LAMBERT Academic Publishing, 2018
ISBN 10: 6202053852
ISBN 13: 9786202053853
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 - 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. Seller Inventory # 9786202053853
Buy New
US$ 35.98
US$ 68.86 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 1 available
Seller Image
On Three Graph Layout Problems
Published by
LAP LAMBERT Academic Publishing, 2018
ISBN 10: 6202053852
ISBN 13: 9786202053853
New
Taschenbuch
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 111324878
Buy New
US$ 30.86
US$ 79.58 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: 5 available