Coverart for item
The Resource Graph-theoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.)

Graph-theoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.)

Label
Graph-theoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers
Title
Graph-theoretic concepts in computer science
Title remainder
39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers
Statement of responsibility
Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.)
Title variation
WG 2013
Creator
Contributor
Editor
Provider
Subject
Genre
Language
eng
Summary
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
Member of
Cataloging source
GW5XE
Image bit depth
0
LC call number
QA166
LC item number
.C66 2013
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2013
http://bibfra.me/vocab/lite/meetingName
International Workshop WG
Nature of contents
dictionaries
NLM call number
QA 267.G47
http://library.link/vocab/relatedWorkOrContributorName
  • SpringerLink
  • Brandstädt, Andreas
  • Jansen, Klaus
  • Reischuk, Rüdiger
Series statement
Lecture Notes in Computer Science,
Series volume
8165
http://library.link/vocab/subjectName
  • Graph theory
  • Computer science
  • Computers
  • Electronic Data Processing
  • Computer Science
  • Discrete Mathematics in Computer Science
  • Algorithm Analysis and Problem Complexity
  • Geometry
  • Computer science
  • Graph theory
Label
Graph-theoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.)
Instantiates
Publication
Note
Includes author index
Antecedent source
mixed
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
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
Dimensions
unknown
Extent
1 online resource (xx, 430 pages)
File format
multiple file formats
Form of item
  • online
  • electronic
Isbn
9783642450426
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-642-45043-3
Other physical details
illustrations.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (OCoLC)867773812
  • (OCoLC)ocn867773812
Label
Graph-theoretic concepts in computer science : 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, Andreas Brandstädt, Klaus Jansen, Rüdiger Reischuk (eds.)
Publication
Note
Includes author index
Antecedent source
mixed
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
not applicable
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
Contents
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
Dimensions
unknown
Extent
1 online resource (xx, 430 pages)
File format
multiple file formats
Form of item
  • online
  • electronic
Isbn
9783642450426
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-642-45043-3
Other physical details
illustrations.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (OCoLC)867773812
  • (OCoLC)ocn867773812

Library Locations

  • African Studies LibraryBorrow it
    771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Alumni Medical LibraryBorrow it
    72 East Concord Street, Boston, MA, 02118, US
    42.336388 -71.072393
  • Astronomy LibraryBorrow it
    725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US
    42.350259 -71.105717
  • Fineman and Pappas Law LibrariesBorrow it
    765 Commonwealth Avenue, Boston, MA, 02215, US
    42.350979 -71.107023
  • Frederick S. Pardee Management LibraryBorrow it
    595 Commonwealth Avenue, Boston, MA, 02215, US
    42.349626 -71.099547
  • Howard Gotlieb Archival Research CenterBorrow it
    771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Mugar Memorial LibraryBorrow it
    771 Commonwealth Avenue, Boston, MA, 02215, US
    42.350723 -71.108227
  • Music LibraryBorrow it
    771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350723 -71.108227
  • Pikering Educational Resources LibraryBorrow it
    2 Silber Way, Boston, MA, 02215, US
    42.349804 -71.101425
  • School of Theology LibraryBorrow it
    745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US
    42.350494 -71.107235
  • Science & Engineering LibraryBorrow it
    38 Cummington Mall, Boston, MA, 02215, US
    42.348472 -71.102257
  • Stone Science LibraryBorrow it
    675 Commonwealth Avenue, Boston, MA, 02445, US
    42.350103 -71.103784
Processing Feedback ...