|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-3-540-31468-4 |
003 |
DE-He213 |
005 |
20230810201422.0 |
007 |
cr nn 008mamaa |
008 |
100409s2005 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540314684
|9 978-3-540-31468-4
|
024 |
7 |
|
|a 10.1007/11604686
|2 doi
|
050 |
|
4 |
|a QA75.5-76.95
|
072 |
|
7 |
|a UYA
|2 bicssc
|
072 |
|
7 |
|a COM014000
|2 bisacsh
|
072 |
|
7 |
|a UYA
|2 thema
|
082 |
0 |
4 |
|a 004.0151
|2 23
|
245 |
1 |
0 |
|a Graph-Theoretic Concepts in Computer Science
|h [electronic resource] :
|b 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers /
|c edited by Dieter Kratsch.
|
250 |
|
|
|a 1st ed. 2005.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2005.
|
300 |
|
|
|a XIV, 478 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 3787
|
505 |
0 |
|
|a 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.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Computer simulation.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Computer science
|x Mathematics.
|
650 |
|
0 |
|a Discrete mathematics.
|
650 |
|
0 |
|a Numerical analysis.
|
650 |
|
0 |
|a Artificial intelligence
|x Data processing.
|
650 |
1 |
4 |
|a Theory of Computation.
|
650 |
2 |
4 |
|a Computer Modelling.
|
650 |
2 |
4 |
|a Algorithms.
|
650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
650 |
2 |
4 |
|a Numerical Analysis.
|
650 |
2 |
4 |
|a Data Science.
|
700 |
1 |
|
|a Kratsch, Dieter.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer Nature eBook
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540819165
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540310006
|
830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 3787
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/11604686
|z Texto Completo
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-SXCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (SpringerNature-11645)
|
950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|