Knihobot

Graph Theory and Algorithms

Parametry

  • 228 stránek
  • 8 hodin čtení

Více o knize

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.

Nákup knihy

Graph Theory and Algorithms, N. Saito, T. Nishizeki

Jazyk
Rok vydání
1981
Vazba
(měkká)
Jakmile se objeví, pošleme e-mail.

Doručení

  • Doprava zdarma od 499 Kč po celém Česku! Více info

Platební metody

Nikdo zatím neohodnotil.Ohodnotit

Titul
Graph Theory and Algorithms
Jazyk
anglicky
Vydavatel
Springer
Rok vydání
1981
Vazba
měkká
Počet stran
228
ISBN10
3540107045
ISBN13
9783540107040
Série
Štítky
Anotace
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.