단행본 상세

서지주요정보
Graph-Theoretic Concepts in Computer Science: 21st International Workshop, WG '95, Aachen, Germany, June 20 - 22, 1995. Proceedings
서명 / 저자 Graph-Theoretic Concepts in Computer Science [electronic resource] : 21st International Workshop, WG '95, Aachen, Germany, June 20 - 22, 1995. Proceedings / edited by Manfred Nagl.
저자명 Nagl, Manfred. editor. edt http://id.loc.gov/vocabulary/relators/edt
단체명 SpringerLink (Online service)
판사항 1st ed. 1995.
발행사항 Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1995.
총서명 Lecture Notes in Computer Science, 1611-3349 ; 1017
Online Access https://doi.org/10.1007/3-540-... URL

서지기타정보

서지기타정보
ISBN 9783540484875
기타 표준번호 10.1007/3-540-60618-1
청구기호 QA166-166.247
형태사항 XII, 411 p. online resource.
언어 English
내용 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.
주제 Graph theory.
Computer science.
Algorithms.
Discrete mathematics.
Graph Theory.
Theory of Computation.
Algorithms.
Discrete Mathematics.
Computer Science Logic and Foundations of Programming.
보유판 및 특별호 저록 Springer Nature eBook
Printed edition: 9783662214091 Printed edition: 9783540606185
QR CODE