Graph-Theoretic Concepts in Computer Science : 21st International Workshop, WG '95, Aachen, Germany, June 20 - 22, 1995. Proceedings - Taschenbuch

EAN (ISBN-13): 9783540606185
ISBN (ISBN-10): 3540606181
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1995
Herausgeber: Springer Berlin
406 Seiten
Gewicht: 0,637 kg

Buch in der Datenbank seit 2007-06-06T20:13:27+02:00 (Berlin)
Detailseite zuletzt geändert am 2023-12-02T15:34:44+01:00 (Berlin)
ISBN/EAN: 9783540606185

ISBN - alternative Schreibweisen:
3-540-60618-1, 978-3-540-60618-5
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: manfred nagl, aachen
Titel des Buches: graph theoretic concepts computer science, lecture notes computer science, proceedings first international workshop, aachen 1914 1918, aachen 1945 1970

---

Daten vom Verlag:

Autor/in: Manfred Nagl
Titel: Lecture Notes in Computer Science; Graph-Theoretic Concepts in Computer Science - 21st International Workshop, WG '95, Aachen, Germany, June 20 - 22, 1995. Proceedings
Verlag: Springer; Springer Berlin
411 Seiten
Erscheinungsjahr: 1995-11-17
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XII, 411 p.

BC; Hardcover, Softcover / Mathematik/Sonstiges; Kombinatorik und Graphentheorie; Verstehen; Coloured Graphs; Graph; Graph Algorithms; Graph Computations; Graph theory; Graphalgorithmen; Graphentheoretische Berechnungen; computer; computer science; graph Ttransfomrations; graphtransformationen; algorithm analysis and problem complexity; combinatorics; Graph Theory; Theory of Computation; Algorithms; Discrete Mathematics; Computer Science Logic and Foundations of Programming; Theoretische Informatik; Algorithmen und Datenstrukturen; Diskrete Mathematik; EA

VC-dimensions for graphs (extended abstract).- Finding and counting small induced subgraphs efficiently.- On the isomorphism of graphs with few P4s.- A dynamic algorithm for line graph recognition.- Incremental hive graph.- Planarization of graphs embedded on surfaces.- Complexity and approximability of certain bicriteria location problems.- On termination of graph rewriting.- A uniform approach to graph rewriting: The pullback approach.- Visualizing two- and three-dimensional models of meristematic growth.- Graph-theoretical methods to construct entity-relationship databases.- An approximation algorithm for 3-Colourability.- The malleability of TSP 2Opt.- Non-oblivious local search for graph and hypergraph coloring problems.- On Interval Routing Schemes and treewidth.- Highly fault-tolerant routings and diameter vulnerability for generalized hypercube graphs.- Hot-potato routing on multi-dimensional tori.- On devising Boolean Routing schemes.- Toward a general theory of unicast-based multicast communication.- Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes.- Searching for faulty leaves in binary trees.- NC algorithms for partitioning planar graphs into induced forests and approximating NP-hard problems.- Efficient parallel modular decomposition (extended abstract).- Modular decomposition of hypergraphs.- Partition coefficients of acyclic graphs.- Sub-cubic cost algorithms for the all pairs shortest path problem.- Diametral path graphs.- Chordal graphs and their clique graphs.- A compact data structure and parallel algorithms for permutation graphs.- Homogeneously orderable graphs and the Steiner tree problem.