Graph Theory and Algorithms

17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. Proceedings

AvN. Saito,T. Nishizeki

Häftad, Engelska, 1981

Del i serien Lecture Notes in Computer Science

573 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1981-05-01
Mått:155 x 235 x 13 mm
Vikt:353 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:220
Upplaga:1981
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540107040

Utforska kategorier

Programmeringsböcker inom Data och IT

Innehållsförteckning

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.

Du kanske också är intresserad av

Planar Graphs

N. Chiba, T. Nishizeki

E-bok

1988

702 kr

Planar Graphs

T. Nishizeki, N. Chiba

Häftad, 2008

217 kr

Statistical Physics I

N. Saito, R. Kubo, M. Toda

E-bok

2012

1 148 kr

Del 30

Operator Theory and Numerical Methods

H. Fujita, N. Saito, T. Suzuki

Inbunden, 2001

1 486 kr

Ecological Design of Smart Home Networks

D Menga, N. Saito

E-bok

2015

3 140 kr

Operator Theory and Numerical Methods

T. Suzuki, N. Saito, H. Fujita

E-bok

2001

1 296 kr

Ecological Design of Smart Home Networks

N. Saito, D Menga

Inbunden, 2015

2 480 kr

SPIN STRUCTURE OF THE NUCLEON - PROCEEDINGS OF THE THE RIKEN SYMPOSIUM

SHIB OHTA A SHIBATA SHIBAA N SAITO, T-A Shibata, S Ohta, N Saito

Inbunden, 1996

724 kr

Ruth Kvarnström-Jones - SIGNERAD - Systrarna på Sophiahemmet, Inbunden

Signerad!

Del 3

SIGNERAD - Systrarna på Sophiahemmet

Ruth Kvarnström-Jones

Inbunden, 2026

249 kr

Nyhet

Domino : Dåren, domaren och den välkammade mannen från pirayaministeriet

Håkan Nesser

Inbunden, 2026

259 kr

Graph Theory and Algorithms

17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. Proceedings

AvN. Saito,T. Nishizeki

Häftad, Engelska, 1981

Del i serien Lecture Notes in Computer Science

573 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1981-05-01
Mått:155 x 235 x 13 mm
Vikt:353 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:220
Upplaga:1981
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540107040

Utforska kategorier

Programmeringsböcker inom Data och IT

Innehållsförteckning

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.