Graph-Theoretic Concepts in Computer Science [Elektronisk resurs] 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers / edited by Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk.
-
Brandstädt, Andreas. (redaktör/utgivare)
-
Jansen, Klaus. (redaktör/utgivare)
-
Reischuk, Rüdiger. (redaktör/utgivare)
-
SpringerLink (Online service)
- ISBN 9783642450433
- Publicerad: Berlin, Heidelberg : Springer Berlin Heidelberg : 2013
- Engelska XX, 430 p. 114 illus.
-
Serie: Lecture Notes in Computer Science, 0302-9743 ; 8165
- Relaterad länk:
-
http://dx.doi.org/10... (Table of Contents / Abstracts)
Innehållsförteckning
Sammanfattning
Ämnesord
Stäng
- Tree-Like Structures in Graphs: A Metric Point of View -- Overview of New Approaches for Approximating TSP -- Linear Rank-Width and Linear Clique-Width of Trees -- Threshold-Coloring and Unit-Cube Contact Representation of Graphs -- Rolling Upward Planarity Testing of Strongly Connected Graphs -- Towards a Provably Resilient Scheme for Graph-Based Watermarking -- The Normal Graph Conjecture for Classes of Sparse Graphs -- On the Parameterized Complexity of Computing Graph Bisections -- Fixed-Parameter Tractability and Characterizations of Small Special Treewidth -- The θ5-Graph is a Spanner -- Graphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations (Extended Abstract) -- Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs -- Equilateral L-Contact Graphs -- Parameterized and Approximation Algorithms for the MAF Problem in Multifurcating Trees -- Linear Separation of Total Dominating Sets in Graphs -- Sparse Square Roots -- Completing Colored Graphs to Meet a Target Property -- Colouring of Graphs with Ramsey-Type Forbidden Subgraphs -- Lower and Upper Bounds for Long Induced Paths in 3-Connected Planar Graphs -- Computing Minimum Cycle Bases in Weighted Partial 2-Trees in Linear Time -- Thickness and Colorability of Geometric Graphs -- The Same Upper Bound for Both: The 2-Page and the Rectilinear Crossing Numbers of the n-Cube -- FPT Is Characterized by Useful Obstruction Sets -- Excluding Graphs as Immersions in Surface Embedded -- OBDD-Based Representation of Interval Graphs -- Tight Upper Bounds for Minimum Feedback Arc Sets of Regular -- A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem -- On Retracts, Absolute Retracts, and Folds in Cographs -- Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(log log n) Colors -- On Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs -- Certifying 3-Edge-Connectivity -- Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs -- Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs -- Beyond Knights and Knaves -- Drawing Graphs with Few Arcs -- Connecting Terminals and 2-Disjoint Connected Subgraphs.
- This book constitutes the thoroughly refereed proceedings of the 39th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2013, held in Lübeck, Germany, in June 2013. The 34 revised full papers presented were carefully reviewed and selected from 61 submissions. The book also includes two abstracts. The papers cover a wide range of topics in graph theory related to computer science, such as structural graph theory with algorithmic or complexity applications; design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; computational complexity of graph and network problems; computational geometry; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications.
Ämnesord
- Computer science. (LCSH)
- Data structures (Computer science). (LCSH)
- Computer software. (LCSH)
- Computational complexity. (LCSH)
- Algorithms. (LCSH)
- Geometry. (LCSH)
- Computer Science.
- Discrete Mathematics in Computer Science.
- Algorithm Analysis and Problem Complexity.
- Data Structures.
- Geometry.
- Algorithms.
Klassifikation
- QA76.9.M35 (LCC)
- COM018000 (ämneskategori)
- MAT008000 (ämneskategori)
- 004.0151 (DDC)
- Pu (kssb/8 (machine generated))
Inställningar
Hjälp
Titeln finns på 16 bibliotek.
Ange som favorit
-
Luleå universitetsbibliotek, Digitala resurser (LTUd)Ange som favorit
-
Bibliotekets webbplats
-
-
Läs hela (Online access for LTU) (Springer Lecture Notes in Computer Science eBooks)
Öppettider, adress m.m.
-
Mittuniversitetet, Digitala biblioteket (Miun)Ange som favorit
-
Bibliotekets webbplats
-
-
Läs hela (Online access for MIU) (Springer Nature Complete eBooks) (fulltext)
-
Läs hela (Online access for MIU) (Springer Lecture Notes in Computer Science eBooks) (fulltext)
Öppettider, adress m.m.
-
Umeå universitetsbibliotek, Digitala resurser (Qdig)Ange som favorit
-
Bibliotekets lokala katalog
-
-
Läs hela (Online access for UMUB) (fulltext) (Springer Lecture Notes in Computer Science)
Öppettider, adress m.m.
Ange som favorit
-
Karlstads universitetsbibliotek, Digitala resurser (Kdig)Ange som favorit
-
Titeln i bibliotekets lokala katalogKauLink
-
-
Läs hela (Online access for KaU) (Springer Lecture Notes in Computer Science eBooks) (fulltext)
-
Läs hela (Online access for KaU) (Springer eBooks (Computer Science/LNCS 2013)) (fulltext)
Öppettider, adress m.m.
-
Mälardalens universitet, Digitala resurser (Mdhd)Ange som favorit
-
Bibliotekets webbplats
-
-
Läs hela (Tillgänglig för användare inom Mälardalens högskola) (fulltext) (Springer Lecture Notes in Computer Science eBooks)
Öppettider, adress m.m.
-
Örebro universitetsbibliotek, Digitala resurser (Odig)Ange som favorit
-
-
Läs hela (Tillgänglig inom Örebro universitet och externt för studenter och anställda vid universitetet) (fulltext) (Lecture Notes in Computer Science)
Öppettider, adress m.m.
Ange som favorit
-
Stockholms universitetsbibliotek, Digitala resurser (Hdig)Ange som favorit
-
-
Läs hela (Tillgänglig för användare inom Stockholms universitet) (SpringerLink Books - AutoHoldings:Full Text)
Öppettider, adress m.m.
-
Patent- och registreringsverket, Biblioteket (Pvd)Ange som favorit
-
Bibliotekets lokala katalog
-
-
Läs hela (Tillgänglig på PRV) (Springer Lecture Notes in Computer Science eBooks) (fulltext)
Öppettider, adress m.m.
-
Kungliga Tekniska högskolan, E-resurser (Tdig)Ange som favorit
-
Bibliotekets lokala katalog
-
-
Läs hela (Online access for KTHB) (fulltext) (Springer)
Öppettider, adress m.m.
Ange som favorit
-
Linköpings universitetsbibliotek, E-resurser (LiUd)Ange som favorit
-
Bibliotekets lokala katalog
-
-
Läs hela (Extern tillgång endast anställda och studenter vid LiU) (Springer Computer Science eBooks 2013 English/International) (Springer Lecture Notes in Computer Science eBooks)
Öppettider, adress m.m.
Ange som favorit
-
Göteborgs universitetsbibliotek, E-resurser (Gdix)Ange som favorit
-
Bibliotekets lokala katalogFind@GU
-
-
Läs hela (Tillgänglig för Göteborgs universitet / Online access for the University of Gothenburg) (Springer eBooks:Full Text)
Öppettider, adress m.m.
-
Högskolan i Borås, Biblioteket, Digitala resurser (Hibd)Ange som favorit
-
Bibliotekets lokala katalog
-
-
Läs hela (Tillgänglig för användare inom Högskolan i Borås) (fulltext) (Springer Lecture Notes in Computer Science eBooks)
Öppettider, adress m.m.
-
Chalmers tekniska högskola, E-resurser (Zdig)Ange som favorit
-
Bibliotekets lokala katalog
-
-
Läs hela (Online access for Chalmers) (Springer Computer Science eBooks 2013 English/International)
Öppettider, adress m.m.
Ange som favorit
-
Lunds universitets bibliotek, Digitala resurser (Ldix)Ange som favorit
-
Titeln i bibliotekets lokala katalog
-
-
Läs hela (Online access for Lund University) (Springer Lecture Notes in Computer Science eBooks) (Springer eBooks (Computer Science/LNCS 2013))
Utlånad?Öppettider, adress m.m.
-
Linnéuniversitetet, Universitetsbiblioteket, E-resurser (LnuE)Ange som favorit
-
Titeln i bibliotekets lokala katalog
-
-
Läs hela (Online access for Linnaeus University) (fulltext) (Springer Lecture Notes in Computer Science eBooks)
Öppettider, adress m.m.
-
Malmö universitetsbibliotek, E-resurser (Maud)Ange som favorit
-
Bibliotekets webbplats
-
-
Läs hela (Online access for MAU) (Springer Lecture Notes in Computer Science eBooks) (fulltext)
Öppettider, adress m.m.