The Resource Graph-theoretic concepts in computer science : 31st international workshop, WG 2005, Metz, France, June 23-25, 2005 : revised selected papers, Dieter Kratsch (ed.)
Graph-theoretic concepts in computer science : 31st international workshop, WG 2005, Metz, France, June 23-25, 2005 : revised selected papers, Dieter Kratsch (ed.)
Resource Information
The item Graph-theoretic concepts in computer science : 31st international workshop, WG 2005, Metz, France, June 23-25, 2005 : revised selected papers, Dieter Kratsch (ed.) 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 Graph-theoretic concepts in computer science : 31st international workshop, WG 2005, Metz, France, June 23-25, 2005 : revised selected papers, Dieter Kratsch (ed.) 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.
- Extent
- 1 online resource (xiv, 470 pages)
- Contents
-
- Invited Lectures
- Hypertree Decompositions: Structure, Algorithms, and Applications
- Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey
- Regular Papers
- Domination Search on Graphs with Low Dominating-Target-Number
- Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs
- Approximating Rank-Width and Clique-Width Quickly
- Computing the Tutte Polynomial on Graphs of Bounded Clique-Width
- Minimizing NLC-Width is NP-Complete
- Channel Assignment and Improper Choosability of Graphs
- Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time
- Roman Domination over Some Graph Classes
- Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms
- Network Discovery and Verification
- Complete Graph Drawings Up to Triangle Mutations
- Collective Tree 1-Spanners for Interval Graphs
- On Stable Cutsets in Claw-Free Graphs and Planar Graphs
- Induced Subgraphs of Bounded Degree and Bounded Treewidth
- Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time
- Ultimate Generalizations of LexBFS and LEX M
- Adding an Edge in a Cograph
- The Computational Complexity of Delay Management
- Acyclic Choosability of Graphs with Small Maximum Degree
- Generating Colored Trees
- Optimal Hypergraph Tree-Realization
- Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints
- On the Fixed-Parameter Enumerability of Cluster Editing
- Locally Consistent Constraint Satisfaction Problems with Binary Constraints
- On Randomized Broadcasting in Star Graphs
- Finding Disjoint Paths on Directed Acyclic Graphs
- Approximation Algorithms for the Bi-criteria Weighted max-cut Problem
- Approximation Algorithms for the Weighted Independent Set Problem
- Approximation Algorithms for Unit Disk Graphs
- Computation of Chromatic Polynomials Using Triangulations and Clique Trees
- Computing Branchwidth Via Efficient Triangulations and Blocks
- Algorithms Based on the Treewidth of Sparse Graphs
- Extending the Tractability Border for Closest Leaf Powers
- Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition Model
- Algebraic Operations on PQ Trees and Modular Decomposition Trees
- Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs
- Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny
- Recognizing HHDS-Free Graphs
- Isbn
- 9783540314684
- Label
- Graph-theoretic concepts in computer science : 31st international workshop, WG 2005, Metz, France, June 23-25, 2005 : revised selected papers
- Title
- Graph-theoretic concepts in computer science
- Title remainder
- 31st international workshop, WG 2005, Metz, France, June 23-25, 2005 : revised selected papers
- Statement of responsibility
- Dieter Kratsch (ed.)
- Title variation
- WG 2005
- Subject
-
- Computer science
- Computer science -- Congresses
- Conference papers and proceedings
- Conference papers and proceedings
- Graph theory
- Graph theory
- Graph theory -- Congresses
- Graph theory -- Data processing
- Graph theory -- Data processing
- Graph theory -- Data processing -- Congresses
- Graphentheorie
- Informatique
- MATHEMATICS -- Graphic Methods
- Metz <2005>
- Theoretische Informatik
- Computer science
- Language
- eng
- Cataloging source
- GW5XE
- Dewey number
- 511.5
- Illustrations
- illustrations
- Index
- index present
- LC call number
- QA166
- LC item number
- .G77 2005eb
- Literary form
- non fiction
- http://bibfra.me/vocab/lite/meetingDate
- 2005
- http://bibfra.me/vocab/lite/meetingName
- International Workshop WG
- Nature of contents
-
- dictionaries
- bibliography
- http://library.link/vocab/relatedWorkOrContributorName
- Kratsch, D.
- Series statement
- Lecture notes in computer science,
- Series volume
- 3787
- http://library.link/vocab/subjectName
-
- Computer science
- Graph theory
- Graph theory
- MATHEMATICS
- Informatique
- Computer science
- Graph theory
- Graph theory
- Theoretische Informatik
- Graphentheorie
- Metz <2005>
- Label
- Graph-theoretic concepts in computer science : 31st international workshop, WG 2005, Metz, France, June 23-25, 2005 : revised selected papers, Dieter Kratsch (ed.)
- Bibliography note
- Includes bibliographical references and author 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
- Invited Lectures -- Hypertree Decompositions: Structure, Algorithms, and Applications -- Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey -- Regular Papers -- Domination Search on Graphs with Low Dominating-Target-Number -- Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs -- Approximating Rank-Width and Clique-Width Quickly -- Computing the Tutte Polynomial on Graphs of Bounded Clique-Width -- Minimizing NLC-Width is NP-Complete -- Channel Assignment and Improper Choosability of Graphs -- Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time -- Roman Domination over Some Graph Classes -- Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms -- Network Discovery and Verification -- Complete Graph Drawings Up to Triangle Mutations -- Collective Tree 1-Spanners for Interval Graphs -- On Stable Cutsets in Claw-Free Graphs and Planar Graphs -- Induced Subgraphs of Bounded Degree and Bounded Treewidth -- Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time -- Ultimate Generalizations of LexBFS and LEX M -- Adding an Edge in a Cograph -- The Computational Complexity of Delay Management -- Acyclic Choosability of Graphs with Small Maximum Degree -- Generating Colored Trees -- Optimal Hypergraph Tree-Realization -- Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints -- On the Fixed-Parameter Enumerability of Cluster Editing -- Locally Consistent Constraint Satisfaction Problems with Binary Constraints -- On Randomized Broadcasting in Star Graphs -- Finding Disjoint Paths on Directed Acyclic Graphs -- Approximation Algorithms for the Bi-criteria Weighted max-cut Problem -- Approximation Algorithms for the Weighted Independent Set Problem -- Approximation Algorithms for Unit Disk Graphs -- Computation of Chromatic Polynomials Using Triangulations and Clique Trees -- Computing Branchwidth Via Efficient Triangulations and Blocks -- Algorithms Based on the Treewidth of Sparse Graphs -- Extending the Tractability Border for Closest Leaf Powers -- Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition Model -- Algebraic Operations on PQ Trees and Modular Decomposition Trees -- Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs -- Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny -- Recognizing HHDS-Free Graphs
- Control code
- 262681905
- Dimensions
- unknown
- Extent
- 1 online resource (xiv, 470 pages)
- Form of item
- online
- Isbn
- 9783540314684
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other physical details
- illustrations.
- http://library.link/vocab/ext/overdrive/overdriveId
- 978-3-540-31000-6
- Specific material designation
- remote
- System control number
- (OCoLC)262681905
- Label
- Graph-theoretic concepts in computer science : 31st international workshop, WG 2005, Metz, France, June 23-25, 2005 : revised selected papers, Dieter Kratsch (ed.)
- Bibliography note
- Includes bibliographical references and author 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
- Invited Lectures -- Hypertree Decompositions: Structure, Algorithms, and Applications -- Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey -- Regular Papers -- Domination Search on Graphs with Low Dominating-Target-Number -- Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs -- Approximating Rank-Width and Clique-Width Quickly -- Computing the Tutte Polynomial on Graphs of Bounded Clique-Width -- Minimizing NLC-Width is NP-Complete -- Channel Assignment and Improper Choosability of Graphs -- Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time -- Roman Domination over Some Graph Classes -- Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms -- Network Discovery and Verification -- Complete Graph Drawings Up to Triangle Mutations -- Collective Tree 1-Spanners for Interval Graphs -- On Stable Cutsets in Claw-Free Graphs and Planar Graphs -- Induced Subgraphs of Bounded Degree and Bounded Treewidth -- Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time -- Ultimate Generalizations of LexBFS and LEX M -- Adding an Edge in a Cograph -- The Computational Complexity of Delay Management -- Acyclic Choosability of Graphs with Small Maximum Degree -- Generating Colored Trees -- Optimal Hypergraph Tree-Realization -- Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints -- On the Fixed-Parameter Enumerability of Cluster Editing -- Locally Consistent Constraint Satisfaction Problems with Binary Constraints -- On Randomized Broadcasting in Star Graphs -- Finding Disjoint Paths on Directed Acyclic Graphs -- Approximation Algorithms for the Bi-criteria Weighted max-cut Problem -- Approximation Algorithms for the Weighted Independent Set Problem -- Approximation Algorithms for Unit Disk Graphs -- Computation of Chromatic Polynomials Using Triangulations and Clique Trees -- Computing Branchwidth Via Efficient Triangulations and Blocks -- Algorithms Based on the Treewidth of Sparse Graphs -- Extending the Tractability Border for Closest Leaf Powers -- Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition Model -- Algebraic Operations on PQ Trees and Modular Decomposition Trees -- Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs -- Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny -- Recognizing HHDS-Free Graphs
- Control code
- 262681905
- Dimensions
- unknown
- Extent
- 1 online resource (xiv, 470 pages)
- Form of item
- online
- Isbn
- 9783540314684
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other physical details
- illustrations.
- http://library.link/vocab/ext/overdrive/overdriveId
- 978-3-540-31000-6
- Specific material designation
- remote
- System control number
- (OCoLC)262681905
Subject
- Computer science
- Computer science -- Congresses
- Conference papers and proceedings
- Conference papers and proceedings
- Graph theory
- Graph theory
- Graph theory -- Congresses
- Graph theory -- Data processing
- Graph theory -- Data processing
- Graph theory -- Data processing -- Congresses
- Graphentheorie
- Informatique
- MATHEMATICS -- Graphic Methods
- Metz <2005>
- Theoretische Informatik
- Computer science
Genre
Member of
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 fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Graph-theoretic-concepts-in-computer-science-/JP7mgSJgYJE/" 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/Graph-theoretic-concepts-in-computer-science-/JP7mgSJgYJE/">Graph-theoretic concepts in computer science : 31st international workshop, WG 2005, Metz, France, June 23-25, 2005 : revised selected papers, Dieter Kratsch (ed.)</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 Graph-theoretic concepts in computer science : 31st international workshop, WG 2005, Metz, France, June 23-25, 2005 : revised selected papers, Dieter Kratsch (ed.)
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Graph-theoretic-concepts-in-computer-science-/JP7mgSJgYJE/" 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/Graph-theoretic-concepts-in-computer-science-/JP7mgSJgYJE/">Graph-theoretic concepts in computer science : 31st international workshop, WG 2005, Metz, France, June 23-25, 2005 : revised selected papers, Dieter Kratsch (ed.)</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>
