Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers / / edited by Dieter Kratsch, Ioan Todinca
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers / / edited by Dieter Kratsch, Ioan Todinca |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XI, 422 p. 81 illus.) |
| Disciplina | 511.5 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science—Mathematics
Algorithms Data structures (Computer science) Geometry Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity Data Structures |
| ISBN | 3-319-12340-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms -- Structural graph theory with algorithmic or complexity applications -- Computational complexity of graph and network problems -- Graph grammars, graph rewriting systems and graph modeling -- Graph drawing and layouts -- Computational geometry -- Random graphs and models of the web and scale-free networks -- Support of these concepts by suitable implementations and applications. |
| Record Nr. | UNISA-996213648103316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science : 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers / / edited by Dieter Kratsch, Ioan Todinca
| Graph-Theoretic Concepts in Computer Science : 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers / / edited by Dieter Kratsch, Ioan Todinca |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XI, 422 p. 81 illus.) |
| Disciplina | 511.5 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science—Mathematics
Algorithms Data structures (Computer science) Geometry Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity Data Structures |
| ISBN | 3-319-12340-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms -- Structural graph theory with algorithmic or complexity applications -- Computational complexity of graph and network problems -- Graph grammars, graph rewriting systems and graph modeling -- Graph drawing and layouts -- Computational geometry -- Random graphs and models of the web and scale-free networks -- Support of these concepts by suitable implementations and applications. |
| Record Nr. | UNINA-9910483847003321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007, Revised Papers / / edited by Andreas Brandstädt, Dieter Kratsch, Haiko Müller
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007, Revised Papers / / edited by Andreas Brandstädt, Dieter Kratsch, Haiko Müller |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XIII, 344 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer simulation Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Theory of Computation Computer Modelling Discrete Mathematics in Computer Science Numerical Analysis Data Science |
| ISBN | 3-540-74839-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs -- Recognizing Bipartite Tolerance Graphs in Linear Time -- Graph Searching in a Crime Wave -- Monotonicity of Non-deterministic Graph Searching -- Tree-Width and Optimization in Bounded Degree Graphs -- On Restrictions of Balanced 2-Interval Graphs -- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions -- The Clique-Width of Tree-Power and Leaf-Power Graphs -- NLC-2 Graph Recognition and Isomorphism -- A Characterisation of the Minimal Triangulations of Permutation Graphs -- The 3-Steiner Root Problem -- On Finding Graph Clusterings with Maximum Modularity -- On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs -- A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs -- Approximation Algorithms for Geometric Intersection Graphs -- An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem -- Mixing 3-Colourings in Bipartite Graphs -- Minimum-Weight Cycle Covers and Their Approximability -- On the Number of ?-Orientations -- Complexity and Approximation Results for the Connected Vertex Cover Problem -- Segmenting Strings Homogeneously Via Trees -- Characterisations and Linear-Time Recognition of Probe Cographs -- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete -- Proper Helly Circular-Arc Graphs -- Pathwidth of Circular-Arc Graphs -- Characterization and Recognition of Digraphs of Bounded Kelly-width -- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms -- Obtaining a Planar Graph by Vertex Deletion -- Mixed Search Number and Linear-Width of Interval and Split Graphs -- Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation -- The Complexity of Bottleneck Labeled Graph Problems. |
| Record Nr. | UNISA-996466068603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science : 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007, Revised Papers / / edited by Andreas Brandstädt, Dieter Kratsch, Haiko Müller
| Graph-Theoretic Concepts in Computer Science : 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007, Revised Papers / / edited by Andreas Brandstädt, Dieter Kratsch, Haiko Müller |
| Edizione | [1st ed. 2007.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 |
| Descrizione fisica | 1 online resource (XIII, 344 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer simulation Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Theory of Computation Computer Modelling Discrete Mathematics in Computer Science Numerical Analysis Data Science |
| ISBN | 3-540-74839-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs -- Recognizing Bipartite Tolerance Graphs in Linear Time -- Graph Searching in a Crime Wave -- Monotonicity of Non-deterministic Graph Searching -- Tree-Width and Optimization in Bounded Degree Graphs -- On Restrictions of Balanced 2-Interval Graphs -- Graph Operations Characterizing Rank-Width and Balanced Graph Expressions -- The Clique-Width of Tree-Power and Leaf-Power Graphs -- NLC-2 Graph Recognition and Isomorphism -- A Characterisation of the Minimal Triangulations of Permutation Graphs -- The 3-Steiner Root Problem -- On Finding Graph Clusterings with Maximum Modularity -- On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs -- A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs -- Approximation Algorithms for Geometric Intersection Graphs -- An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem -- Mixing 3-Colourings in Bipartite Graphs -- Minimum-Weight Cycle Covers and Their Approximability -- On the Number of ?-Orientations -- Complexity and Approximation Results for the Connected Vertex Cover Problem -- Segmenting Strings Homogeneously Via Trees -- Characterisations and Linear-Time Recognition of Probe Cographs -- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete -- Proper Helly Circular-Arc Graphs -- Pathwidth of Circular-Arc Graphs -- Characterization and Recognition of Digraphs of Bounded Kelly-width -- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms -- Obtaining a Planar Graph by Vertex Deletion -- Mixed Search Number and Linear-Width of Interval and Split Graphs -- Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation -- The Complexity of Bottleneck Labeled Graph Problems. |
| Record Nr. | UNINA-9910767505403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers / / edited by Dieter Kratsch
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers / / edited by Dieter Kratsch |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XIV, 478 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer simulation Algorithms Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Theory of Computation Computer Modelling Discrete Mathematics in Computer Science Numerical Analysis Data Science |
| ISBN | 3-540-31468-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNISA-996465863803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science : 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers / / edited by Dieter Kratsch
| Graph-Theoretic Concepts in Computer Science : 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers / / edited by Dieter Kratsch |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XIV, 478 p.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Computer simulation Algorithms Computer science - Mathematics Discrete mathematics Numerical analysis Artificial intelligence - Data processing Theory of Computation Computer Modelling Discrete Mathematics in Computer Science Numerical Analysis Data Science |
| ISBN | 3-540-31468-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNINA-9910483174103321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||