000 04825nam a22006135i 4500
001 978-3-540-31468-4
003 DE-He213
005 20240730170230.0
007 cr nn 008mamaa
008 100409s2005 gw | s |||| 0|eng d
020 _a9783540314684
_9978-3-540-31468-4
024 7 _a10.1007/11604686
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aGraph-Theoretic Concepts in Computer Science
_h[electronic resource] :
_b31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers /
_cedited by Dieter Kratsch.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aXIV, 478 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3787
505 0 _aInvited 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.
650 0 _aComputer science.
_99832
650 0 _aComputer simulation.
_95106
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aNumerical analysis.
_94603
650 0 _aArtificial intelligence
_xData processing.
_921787
650 1 4 _aTheory of Computation.
_992470
650 2 4 _aComputer Modelling.
_992471
650 2 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aNumerical Analysis.
_94603
650 2 4 _aData Science.
_934092
700 1 _aKratsch, Dieter.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_992472
710 2 _aSpringerLink (Online service)
_992473
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540310006
776 0 8 _iPrinted edition:
_z9783540819165
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3787
_992474
856 4 0 _uhttps://doi.org/10.1007/11604686
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c86799
_d86799