Graph Theory and Algorithms
Springer Berlin (Verlag)
978-3-540-10704-0 (ISBN)
Dividing a system into almost unidirectional blocks.- A linear algorithm for five-coloring a planar graph.- On the layering problem of multilayer PWB wiring.- A status on the linear arboricity.- On centrality functions of a graph.- Canonical decompositions of symmetric submodular systems.- The subgraph homeomorphism problem on reducible flow graphs.- Combinatorial problems on series-parallel graphs.- A graph-planarization algorithm and its application to random graphs.- Some common properties for regularizable graphs, edge-critical graphs and b-graphs.- "Dualities" in graph theory and in the related fields viewed from the metatheoretical standpoint.- On central trees of a graph.- On polynomial time computable problems.- Homomorphisms of graphs and their global maps.- Algorithms for some intersection graphs.- An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph.- Characterization of polyhex graphs as applied to chemistry.- The two disjoint path problem and wire routing design.
| Erscheint lt. Verlag | 1.5.1981 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | VIII, 220 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 379 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | algorithm • Algorithm analysis and problem complexity • Algorithmen • algorithms • Algorithmus • Graph • Graphenalgorithmen • Graphentheorie • Graphs • graph theory • Hamiltonian circuit |
| ISBN-10 | 3-540-10704-5 / 3540107045 |
| ISBN-13 | 978-3-540-10704-0 / 9783540107040 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
