The Resource Graphtheoretic concepts in computer science : 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 2124, 2011 : revised papers, Petr Kolman, Jan Kratochvíl (eds.)
Graphtheoretic concepts in computer science : 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 2124, 2011 : revised papers, Petr Kolman, Jan Kratochvíl (eds.)
Resource Information
The item Graphtheoretic concepts in computer science : 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 2124, 2011 : revised papers, Petr Kolman, Jan Kratochvíl (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 2 library branches.
Resource Information
The item Graphtheoretic concepts in computer science : 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 2124, 2011 : revised papers, Petr Kolman, Jan Kratochvíl (eds.) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 2 library branches.
 Summary
 Annotation This text constitutes the revised selected papers of the 37th International Workshop on GraphTheoretic Concepts in Computer Science, WG 2011, held in the Czech Republic, in June 2011. The 28 revised papers presented were carefully reviewed and selected from 52 submissions
 Language
 eng
 Extent
 1 online resource (xi, 344 pages)
 Contents

 Intro; Title page; Preface; Organization; Table of Contents; Structures and Hyperstructures in Metabolic Networks; Introduction; Structural Characterization; Dynamic Characterization; References; Important Separators and Parameterized Algorithms; Introduction; Multiway Cut; Directed Graphs; Conclusions; References; Split Clique Graph Complexity; Introduction; NPComplete Split Clique Graph Classes; Polynomially Solvable Split Clique Graph Classes; Open Related Problems; References; On Searching for Small KochenSpecker Vector Systems; Introduction; KochenSpecker Vector Systems; Embeddability
 Lower BoundsConclusion; References; Characterizations of Deque and Queue Graphs; Introduction; Preliminaries; Deque Graphs; Characterizing Deque Graphs; Hamiltonian Paths in Deque and Queue Graphs; Deciding If a Graph Is a Deque Graph Is NPComplete; Queue Graphs; Conclusion; References; Graph Classes with Structured Neighborhoods and Algorithmic Applications; Introduction; Framework; Upper Bounds on BooleanWidth of Graph Classes; Vertex Partitioning Problems; Lower Bounds; Conclusion; References; Exact Algorithms for Kayles; Introduction; Preliminaries
 An Upper Bound on the Number of KsetsA Bound on the Number of Ksets in Trees; The Exact Algorithm; Lower Bounds; Conclusions; References; The Cinderella Game on Holes and Antiholes; Introduction; Definitions and First Results; The Game on General Graphs; The Game on Holes; Proof of the Upper Bound for GREEDY; Proof of the Lower Bound for GREEDY; The Game on Antiholes; Conclusions and Conjectures; References; On the Complexity of Planar Covering of Small Graphs; Introduction; Hardness of Planar Covering of K_6; Hardness of Planar Covering of K_4, K_5, K_4+ and K_5
 Hardness of Planar Covering of the Dumbbell GraphConclusions; References; Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses; Introduction; Preliminaries; Bounds for sat(M); Inapproximability; The Transformation; Inapproximability for MaxSHDTri; Inapproximability for MaxSHDTies; Conclusion and Open Problems; References; Planarization and Acyclic Colorings of Subcubic ClawFree Graphs; Introduction; Preliminaries and Definitions; Simplifying the Graph; Finding Large Planar Subgraphs; Induced Planar Subgraphs; Planar Subgraphs; Acyclic Colorings
 Acyclically Coloring GR=K_4NPHardness for d {u2265} 4; References; List Coloring in the Absence of a Linear Forest; Introduction; A Generic Approach for Coloring HFree Graphs; Coloring (rP1+P5)Free Graphs; Parameterized Complexity Results; Future Work; References; Parameterized Complexity of Eulerian Deletion Problems; Introduction; Notation and Preliminaries; PolynomialTime Solvable Cases; Eulerian EdgeDeletion Problems; FPT Algorithms; Nonexistence of a Polynomial Kernel for Undirected and Directed Eulerian Edge Deletion; NodeDeletion Problems; Conclusion; References
 Isbn
 9783642258701
 Label
 Graphtheoretic concepts in computer science : 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 2124, 2011 : revised papers
 Title
 Graphtheoretic concepts in computer science
 Title remainder
 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 2124, 2011 : revised papers
 Statement of responsibility
 Petr Kolman, Jan Kratochvíl (eds.)
 Subject

 Algorithms
 Computational complexity
 Computer Communication Networks
 Computer Science
 Computer science
 Computer science
 Computer science
 Computer science  Congresses
 Computer software
 Conference papers and proceedings
 Conference papers and proceedings
 Data Structures
 Data structures (Computer science)
 Discrete Mathematics in Computer Science
 Engineering & Applied Sciences
 Geometry
 Graph theory
 Graph theory
 Graph theory  Congresses
 Graph theory  Data processing
 Graph theory  Data processing
 Graph theory  Data processing  Congresses
 Informatique
 Algorithm Analysis and Problem Complexity
 Language
 eng
 Summary
 Annotation This text constitutes the revised selected papers of the 37th International Workshop on GraphTheoretic Concepts in Computer Science, WG 2011, held in the Czech Republic, in June 2011. The 28 revised papers presented were carefully reviewed and selected from 52 submissions
 Cataloging source
 GW5XE
 Dewey number
 511/.5
 Illustrations
 illustrations
 Index
 index present
 LC call number
 QA166
 LC item number
 .C664 2011
 Literary form
 non fiction
 http://bibfra.me/vocab/lite/meetingDate
 2011
 http://bibfra.me/vocab/lite/meetingName
 International Workshop WG
 Nature of contents

 dictionaries
 bibliography
 http://library.link/vocab/relatedWorkOrContributorName

 Kolman, Petr
 Kratochvíl, Jan
 Series statement

 Lecture notes in computer science,
 Lecture notes in computer science. Advanced research in computing and software science
 Series volume
 6986
 http://library.link/vocab/subjectName

 Graph theory
 Computer science
 Graph theory
 Informatique
 Computer science
 Graph theory
 Graph theory
 Engineering & Applied Sciences
 Computer Science
 Label
 Graphtheoretic concepts in computer science : 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 2124, 2011 : revised papers, Petr Kolman, Jan Kratochvíl (eds.)
 Antecedent source
 unknown
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 multicolored
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents

 Intro; Title page; Preface; Organization; Table of Contents; Structures and Hyperstructures in Metabolic Networks; Introduction; Structural Characterization; Dynamic Characterization; References; Important Separators and Parameterized Algorithms; Introduction; Multiway Cut; Directed Graphs; Conclusions; References; Split Clique Graph Complexity; Introduction; NPComplete Split Clique Graph Classes; Polynomially Solvable Split Clique Graph Classes; Open Related Problems; References; On Searching for Small KochenSpecker Vector Systems; Introduction; KochenSpecker Vector Systems; Embeddability
 Lower BoundsConclusion; References; Characterizations of Deque and Queue Graphs; Introduction; Preliminaries; Deque Graphs; Characterizing Deque Graphs; Hamiltonian Paths in Deque and Queue Graphs; Deciding If a Graph Is a Deque Graph Is NPComplete; Queue Graphs; Conclusion; References; Graph Classes with Structured Neighborhoods and Algorithmic Applications; Introduction; Framework; Upper Bounds on BooleanWidth of Graph Classes; Vertex Partitioning Problems; Lower Bounds; Conclusion; References; Exact Algorithms for Kayles; Introduction; Preliminaries
 An Upper Bound on the Number of KsetsA Bound on the Number of Ksets in Trees; The Exact Algorithm; Lower Bounds; Conclusions; References; The Cinderella Game on Holes and Antiholes; Introduction; Definitions and First Results; The Game on General Graphs; The Game on Holes; Proof of the Upper Bound for GREEDY; Proof of the Lower Bound for GREEDY; The Game on Antiholes; Conclusions and Conjectures; References; On the Complexity of Planar Covering of Small Graphs; Introduction; Hardness of Planar Covering of K_6; Hardness of Planar Covering of K_4, K_5, K_4+ and K_5
 Hardness of Planar Covering of the Dumbbell GraphConclusions; References; Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses; Introduction; Preliminaries; Bounds for sat(M); Inapproximability; The Transformation; Inapproximability for MaxSHDTri; Inapproximability for MaxSHDTies; Conclusion and Open Problems; References; Planarization and Acyclic Colorings of Subcubic ClawFree Graphs; Introduction; Preliminaries and Definitions; Simplifying the Graph; Finding Large Planar Subgraphs; Induced Planar Subgraphs; Planar Subgraphs; Acyclic Colorings
 Acyclically Coloring GR=K_4NPHardness for d {u2265} 4; References; List Coloring in the Absence of a Linear Forest; Introduction; A Generic Approach for Coloring HFree Graphs; Coloring (rP1+P5)Free Graphs; Parameterized Complexity Results; Future Work; References; Parameterized Complexity of Eulerian Deletion Problems; Introduction; Notation and Preliminaries; PolynomialTime Solvable Cases; Eulerian EdgeDeletion Problems; FPT Algorithms; Nonexistence of a Polynomial Kernel for Undirected and Directed Eulerian Edge Deletion; NodeDeletion Problems; Conclusion; References
 Control code
 768244618
 Dimensions
 unknown
 Extent
 1 online resource (xi, 344 pages)
 File format
 unknown
 Form of item
 online
 Isbn
 9783642258701
 Level of compression
 unknown
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783642258701
 Other physical details
 illustrations (some color).
 Quality assurance targets
 not applicable
 Reformatting quality
 unknown
 Sound
 unknown sound
 Specific material designation
 remote
 System control number
 (OCoLC)768244618
 Label
 Graphtheoretic concepts in computer science : 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 2124, 2011 : revised papers, Petr Kolman, Jan Kratochvíl (eds.)
 Antecedent source
 unknown
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 online resource
 Carrier category code

 cr
 Carrier MARC source
 rdacarrier
 Color
 multicolored
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents

 Intro; Title page; Preface; Organization; Table of Contents; Structures and Hyperstructures in Metabolic Networks; Introduction; Structural Characterization; Dynamic Characterization; References; Important Separators and Parameterized Algorithms; Introduction; Multiway Cut; Directed Graphs; Conclusions; References; Split Clique Graph Complexity; Introduction; NPComplete Split Clique Graph Classes; Polynomially Solvable Split Clique Graph Classes; Open Related Problems; References; On Searching for Small KochenSpecker Vector Systems; Introduction; KochenSpecker Vector Systems; Embeddability
 Lower BoundsConclusion; References; Characterizations of Deque and Queue Graphs; Introduction; Preliminaries; Deque Graphs; Characterizing Deque Graphs; Hamiltonian Paths in Deque and Queue Graphs; Deciding If a Graph Is a Deque Graph Is NPComplete; Queue Graphs; Conclusion; References; Graph Classes with Structured Neighborhoods and Algorithmic Applications; Introduction; Framework; Upper Bounds on BooleanWidth of Graph Classes; Vertex Partitioning Problems; Lower Bounds; Conclusion; References; Exact Algorithms for Kayles; Introduction; Preliminaries
 An Upper Bound on the Number of KsetsA Bound on the Number of Ksets in Trees; The Exact Algorithm; Lower Bounds; Conclusions; References; The Cinderella Game on Holes and Antiholes; Introduction; Definitions and First Results; The Game on General Graphs; The Game on Holes; Proof of the Upper Bound for GREEDY; Proof of the Lower Bound for GREEDY; The Game on Antiholes; Conclusions and Conjectures; References; On the Complexity of Planar Covering of Small Graphs; Introduction; Hardness of Planar Covering of K_6; Hardness of Planar Covering of K_4, K_5, K_4+ and K_5
 Hardness of Planar Covering of the Dumbbell GraphConclusions; References; Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses; Introduction; Preliminaries; Bounds for sat(M); Inapproximability; The Transformation; Inapproximability for MaxSHDTri; Inapproximability for MaxSHDTies; Conclusion and Open Problems; References; Planarization and Acyclic Colorings of Subcubic ClawFree Graphs; Introduction; Preliminaries and Definitions; Simplifying the Graph; Finding Large Planar Subgraphs; Induced Planar Subgraphs; Planar Subgraphs; Acyclic Colorings
 Acyclically Coloring GR=K_4NPHardness for d {u2265} 4; References; List Coloring in the Absence of a Linear Forest; Introduction; A Generic Approach for Coloring HFree Graphs; Coloring (rP1+P5)Free Graphs; Parameterized Complexity Results; Future Work; References; Parameterized Complexity of Eulerian Deletion Problems; Introduction; Notation and Preliminaries; PolynomialTime Solvable Cases; Eulerian EdgeDeletion Problems; FPT Algorithms; Nonexistence of a Polynomial Kernel for Undirected and Directed Eulerian Edge Deletion; NodeDeletion Problems; Conclusion; References
 Control code
 768244618
 Dimensions
 unknown
 Extent
 1 online resource (xi, 344 pages)
 File format
 unknown
 Form of item
 online
 Isbn
 9783642258701
 Level of compression
 unknown
 Media category
 computer
 Media MARC source
 rdamedia
 Media type code

 c
 Other control number
 10.1007/9783642258701
 Other physical details
 illustrations (some color).
 Quality assurance targets
 not applicable
 Reformatting quality
 unknown
 Sound
 unknown sound
 Specific material designation
 remote
 System control number
 (OCoLC)768244618
Subject
 Algorithms
 Computational complexity
 Computer Communication Networks
 Computer Science
 Computer science
 Computer science
 Computer science
 Computer science  Congresses
 Computer software
 Conference papers and proceedings
 Conference papers and proceedings
 Data Structures
 Data structures (Computer science)
 Discrete Mathematics in Computer Science
 Engineering & Applied Sciences
 Geometry
 Graph theory
 Graph theory
 Graph theory  Congresses
 Graph theory  Data processing
 Graph theory  Data processing
 Graph theory  Data processing  Congresses
 Informatique
 Algorithm Analysis and Problem Complexity
Genre
Member of
 Lecture notes in computer science, 6986
 Lecture notes in computer science, Advanced research in computing and software science
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Graphtheoreticconceptsincomputerscience/CALkAcf8sU/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Graphtheoreticconceptsincomputerscience/CALkAcf8sU/">Graphtheoretic concepts in computer science : 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 2124, 2011 : revised papers, Petr Kolman, Jan Kratochvíl (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Graphtheoretic concepts in computer science : 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 2124, 2011 : revised papers, Petr Kolman, Jan Kratochvíl (eds.)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Graphtheoreticconceptsincomputerscience/CALkAcf8sU/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Graphtheoreticconceptsincomputerscience/CALkAcf8sU/">Graphtheoretic concepts in computer science : 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 2124, 2011 : revised papers, Petr Kolman, Jan Kratochvíl (eds.)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>