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.
Applications of Graph Transformations with Industrial Relevance [[electronic resource] ] : 4th International Symposium, AGTIVE 2011, Budapest, Hungary, October 4-7, 2011, Revised Selected Papers / / edited by Andy Schürr, Dániel Varró, Gergely Varró
| Applications of Graph Transformations with Industrial Relevance [[electronic resource] ] : 4th International Symposium, AGTIVE 2011, Budapest, Hungary, October 4-7, 2011, Revised Selected Papers / / edited by Andy Schürr, Dániel Varró, Gergely Varró |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XII, 255 p. 133 illus.) |
| Disciplina | 004.015115 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Computer science—Mathematics
Data structures (Computer science) Software engineering Algorithms Computer logic Mathematical logic Discrete Mathematics in Computer Science Data Structures Software Engineering Algorithm Analysis and Problem Complexity Logics and Meanings of Programs Mathematical Logic and Formal Languages |
| ISBN | 3-642-34176-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Best Practices to Model Business Services in Complex IT Environments -- Drools: A Rule Engine for Complex Event Processing -- Graph Transformation Concepts for Meta-model Evolution Guaranteeing Permanent Type Conformance throughout Model Migration -- A Graph Transformation-Based Semantics for Deep Metamodelling -- Reusable Graph Transformation Templates -- Towards an Automated 3D Reconstruction of Plant Architecture.- Generating Graph Transformation Rules from AML/GT State Machine Diagrams for Building Animated Model Editors -- AGG 2.0 – New Features for Specifying and Analyzing Algebraic Graph Transformations -- Integration of a Pattern-Based Layout Engine into Diagram Editors -- Tool Demonstration of the Transformation Judge -- Knowledge-Based Graph Exploration Analysis.- Graph Grammar Induction as a Parser-Controlled Heuristic Search Process.- Planning Self-adaption with Graph Transformations -- From Graph Transformation Units via MiniSat to GrGen.NET -- Locality in Reasoning about Graph Transformations -- Contextual Hyperedge Replacement -- The Added Value of Programmed Graph Transformations – A Case Study from Software Configuration Management -- A Case Study Based Comparison of ATL and SDM -- Applying Advanced TGG Concepts for a Complex Transformation of Sequence Diagram Specifications to Timed Game Automata -- Automatic Conformance Testing of Optimized Triple Graph Grammar Implementations. Drools: A Rule Engine for Complex Event Processing -- Graph Transformation Concepts for Meta-model Evolution Guaranteeing Permanent Type Conformance throughout Model Migration -- A Graph Transformation-Based Semantics for Deep Metamodelling -- Reusable Graph Transformation Templates -- Towards an Automated 3D Reconstruction of Plant Architecture.- Generating Graph Transformation Rules from AML/GT State Machine Diagrams for Building Animated Model Editors -- AGG 2.0 – New Features for Specifying and Analyzing Algebraic Graph Transformations -- Integration of a Pattern-Based Layout Engine into Diagram Editors -- Tool Demonstration of the Transformation Judge -- Knowledge-Based Graph Exploration Analysis.- Graph Grammar Induction as a Parser-Controlled Heuristic Search Process.- Planning Self-adaption with Graph Transformations -- From Graph Transformation Units via MiniSat to GrGen.NET -- Locality in Reasoning about Graph Transformations -- Contextual Hyperedge Replacement -- The Added Value of Programmed Graph Transformations – A Case Study from Software Configuration Management -- A Case Study Based Comparison of ATL and SDM -- Applying Advanced TGG Concepts for a Complex Transformation of Sequence Diagram Specifications to Timed Game Automata -- Automatic Conformance Testing of Optimized Triple Graph Grammar Implementations. |
| Record Nr. | UNISA-996465298803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-theoretic concepts in computer science : 18. international workshop, WG '92 : Wiesbaden-Naurod, Germany, June 18-20, 1992 : proceedings / E. W. Mayr (ed.)
| Graph-theoretic concepts in computer science : 18. international workshop, WG '92 : Wiesbaden-Naurod, Germany, June 18-20, 1992 : proceedings / E. W. Mayr (ed.) |
| Autore | International workshop WG : <18. : ; 1992 |
| Pubbl/distr/stampa | Berlin [etc.], : Springer-Verlag, c1993 |
| Descrizione fisica | VIII, 349 p. ; 24 cm. |
| Disciplina | 004.015115 |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Grafi - Congressi - 1992
Informatica - Congressi |
| ISBN |
0387564020
3540564020 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISANNIO-AQ10013158 |
International workshop WG : <18. : ; 1992
|
||
| Berlin [etc.], : Springer-Verlag, c1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Sannio | ||
| ||
Graph-theoretic concepts in computer science : 19. international workshop, WG '93 : Utrecht, The Netherlands, June 16-18, 1993 : proceedings / Jan van Leeuwen (ed.)
| Graph-theoretic concepts in computer science : 19. international workshop, WG '93 : Utrecht, The Netherlands, June 16-18, 1993 : proceedings / Jan van Leeuwen (ed.) |
| Autore | International workshop WG '93 : <19. : ; 1993 |
| Pubbl/distr/stampa | Berlin [etc.], : Springer, 1994 |
| Descrizione fisica | IX, 429 p. ; 24 cm |
| Disciplina | 004.015115 |
| Collana | Lecture notes in computer science |
| Soggetto topico | Informatica - Congressi - 1993 |
| ISBN |
0387578994
3540578994 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISANNIO-AQ10007107 |
|
International workshop WG '93 : <19. : ; 1993
|
||
| Berlin [etc.], : Springer, 1994 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. del Sannio | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers / / edited by Christophe Paul, Michel Habib
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers / / edited by Christophe Paul, Michel Habib |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIII, 353 p.) |
| Disciplina | 004.015115 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Geometry Algorithms Artificial intelligence—Data processing Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Data Science |
| ISBN |
1-280-38546-4
9786613563385 3-642-11409-1 |
| Classificazione |
DAT 537f
MAT 055f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph-Theoretic Solutions to Computational Geometry Problems -- Algorithms for Classes of Graphs with Bounded Expansion -- A Graph Polynomial Arising from Community Structure (Extended Abstract) -- Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs -- Maximum Series-Parallel Subgraph -- Low-Port Tree Representations -- Fully Dynamic Representations of Interval Graphs -- The Parameterized Complexity of Some Minimum Label Problems -- Exact and Parameterized Algorithms for Max Internal Spanning Tree -- An Exact Algorithm for Minimum Distortion Embedding -- Sub-coloring and Hypo-coloring Interval Graphs -- Parameterized Complexity of Generalized Domination Problems -- Connected Feedback Vertex Set in Planar Graphs -- Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract) -- On Module-Composed Graphs -- An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees -- The k-Disjoint Paths Problem on Chordal Graphs -- Local Algorithms for Edge Colorings in UDGs -- Directed Rank-Width and Displit Decomposition -- An Algorithmic Study of Switch Graphs -- Hardness Results and Efficient Algorithms for Graph Powers -- Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph -- Injective Oriented Colourings -- Chordal Digraphs -- A New Intersection Model and Improved Algorithms for Tolerance Graphs -- Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes -- Distance d-Domination Games -- Cycles, Paths, Connectivity and Diameter in Distance Graphs -- Smallest Odd Holes in Claw-Free Graphs (Extended Abstract) -- Finding Induced Paths of Given Parity in Claw-Free Graphs. |
| Record Nr. | UNISA-996465915003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science : 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers / / edited by Christophe Paul, Michel Habib
| Graph-Theoretic Concepts in Computer Science : 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009, Revised Papers / / edited by Christophe Paul, Michel Habib |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XIII, 353 p.) |
| Disciplina | 004.015115 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Geometry Algorithms Artificial intelligence—Data processing Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Data Science |
| ISBN |
1-280-38546-4
9786613563385 3-642-11409-1 |
| Classificazione |
DAT 537f
MAT 055f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Graph-Theoretic Solutions to Computational Geometry Problems -- Algorithms for Classes of Graphs with Bounded Expansion -- A Graph Polynomial Arising from Community Structure (Extended Abstract) -- Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs -- Maximum Series-Parallel Subgraph -- Low-Port Tree Representations -- Fully Dynamic Representations of Interval Graphs -- The Parameterized Complexity of Some Minimum Label Problems -- Exact and Parameterized Algorithms for Max Internal Spanning Tree -- An Exact Algorithm for Minimum Distortion Embedding -- Sub-coloring and Hypo-coloring Interval Graphs -- Parameterized Complexity of Generalized Domination Problems -- Connected Feedback Vertex Set in Planar Graphs -- Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract) -- On Module-Composed Graphs -- An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees -- The k-Disjoint Paths Problem on Chordal Graphs -- Local Algorithms for Edge Colorings in UDGs -- Directed Rank-Width and Displit Decomposition -- An Algorithmic Study of Switch Graphs -- Hardness Results and Efficient Algorithms for Graph Powers -- Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph -- Injective Oriented Colourings -- Chordal Digraphs -- A New Intersection Model and Improved Algorithms for Tolerance Graphs -- Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes -- Distance d-Domination Games -- Cycles, Paths, Connectivity and Diameter in Distance Graphs -- Smallest Odd Holes in Claw-Free Graphs (Extended Abstract) -- Finding Induced Paths of Given Parity in Claw-Free Graphs. |
| Record Nr. | UNINA-9910484753003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers / / edited by Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniel Paulusma
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers / / edited by Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniel Paulusma |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XIII, 386 p.) |
| Disciplina | 004.015115 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Data Science Computer Graphics |
| ISBN | 3-540-92248-2 |
| Classificazione |
DAT 537f
MAT 055f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Contributions -- (Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective -- Memory Efficient Anonymous Graph Exploration -- Algorithmic Meta Theorems -- Regular Papers -- A Most General Edge Elimination Polynomial -- Approximating the Metric TSP in Linear Time -- The Valve Location Problem in Simple Network Topologies -- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs -- On the Pseudo-achromatic Number Problem -- Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings -- Faster Exact Bandwidth -- Additive Spanners for Circle Graphs and Polygonal Graphs -- Upward Straight-Line Embeddings of Directed Graphs into Point Sets -- Complexity of the Packing Coloring Problem for Trees -- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges -- A Lower Bound on the Area Requirements of Series-Parallel Graphs -- On Independent Sets and Bicliques in Graphs -- Evaluations of Graph Polynomials -- Parameterized Complexity for Domination Problems on Degenerate Graphs -- An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph -- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs -- The Rank-Width of the Square Grid -- Improved Upper Bounds for Partial Vertex Cover -- On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width -- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms -- What Is between Chordal and Weakly Chordal Graphs? -- Parameterized Graph Cleaning Problems -- Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph -- Fast Robber in Planar Graphs -- From a Circular-Arc Model to a Proper Circular-Arc Model -- Digraph Decompositions and Monotonicity in Digraph Searching -- Searching for a Visible, Lazy Fugitive -- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes -- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs. |
| Record Nr. | UNISA-996466367903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers / / edited by Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniel Paulusma
| Graph-Theoretic Concepts in Computer Science : 34th International Workshop, WG 2008, Durham, UK, June 30 -- July 2, 2008, Revised Papers / / edited by Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniel Paulusma |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XIII, 386 p.) |
| Disciplina | 004.015115 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer science—Mathematics Discrete mathematics Numerical analysis Artificial intelligence—Data processing Computer graphics Discrete Mathematics in Computer Science Numerical Analysis Data Science Computer Graphics |
| ISBN | 3-540-92248-2 |
| Classificazione |
DAT 537f
MAT 055f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Contributions -- (Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective -- Memory Efficient Anonymous Graph Exploration -- Algorithmic Meta Theorems -- Regular Papers -- A Most General Edge Elimination Polynomial -- Approximating the Metric TSP in Linear Time -- The Valve Location Problem in Simple Network Topologies -- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs -- On the Pseudo-achromatic Number Problem -- Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings -- Faster Exact Bandwidth -- Additive Spanners for Circle Graphs and Polygonal Graphs -- Upward Straight-Line Embeddings of Directed Graphs into Point Sets -- Complexity of the Packing Coloring Problem for Trees -- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges -- A Lower Bound on the Area Requirements of Series-Parallel Graphs -- On Independent Sets and Bicliques in Graphs -- Evaluations of Graph Polynomials -- Parameterized Complexity for Domination Problems on Degenerate Graphs -- An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph -- Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs -- The Rank-Width of the Square Grid -- Improved Upper Bounds for Partial Vertex Cover -- On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width -- Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms -- What Is between Chordal and Weakly Chordal Graphs? -- Parameterized Graph Cleaning Problems -- Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph -- Fast Robber in Planar Graphs -- From a Circular-Arc Model to a Proper Circular-Arc Model -- Digraph Decompositions and Monotonicity in Digraph Searching -- Searching for a Visible, Lazy Fugitive -- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes -- Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs. |
| Record Nr. | UNINA-9910483945703321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 Proceedings / / edited by Andreas Brandstädt, Van Bang Le
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 Proceedings / / edited by Andreas Brandstädt, Van Bang Le |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (X, 334 p.) |
| Disciplina | 004.015115 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Computers Data structures (Computer science) Algorithms Computer science—Mathematics Programming Techniques Theory of Computation Data Structures and Information Theory Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Data Structures |
| ISBN | 3-540-45477-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces -- Data Management in Networks -- Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs -- Approximate Constrained Bipartite Edge Coloring -- Maximum Clique Transversals -- On the Tree-Degree of Graphs -- On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms -- (k+) -Disatance- Herediatry Graphs -- On the Relationship between Clique-Width and Treewidth -- Planarity of the 2-Level Cactus Model -- Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach -- How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time -- (g, f)-Factorizations Orthogonal to k Subgraphs -- On Star Coloring of Graphs -- Graph Subcolorings: Complexity and Algorithms -- Approximation of Pathwidth of Outerplanar Graphs -- On the Monotonicity of Games Generated by Symmetric Submodular Functions -- Multiple Hotlink Assignment -- Small k-Dominating Sets in Planar Graphs with Applications -- Lower Bounds for Algorithms for the Steiner Tree Problem -- log n-Approximative NLCk-Decomposition in O(n 2k+1) Time -- On Subfamilies of AT-Free Graphs -- Complexity of Coloring Graphs without Forbidden Induced Subgraphs -- On Stable Cutsets in Line Graphs -- On Strong Menger-Connectivity of Star Graphs -- The Complexity of the Matching-Cut Problem -- De Bruijn Graphs and DNA Graphs -- A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness -- Critical and Anticritical Edges in Perfect Graphs. |
| Record Nr. | UNISA-996465886903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science : 27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 Proceedings / / edited by Andreas Brandstädt, Van Bang Le
| Graph-Theoretic Concepts in Computer Science : 27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 Proceedings / / edited by Andreas Brandstädt, Van Bang Le |
| Edizione | [1st ed. 2001.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 |
| Descrizione fisica | 1 online resource (X, 334 p.) |
| Disciplina | 004.015115 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer programming
Computers Data structures (Computer science) Algorithms Computer science—Mathematics Programming Techniques Theory of Computation Data Structures and Information Theory Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Data Structures |
| ISBN | 3-540-45477-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Median Hulls as Steiner Hulls in Rectilinear and Molecular Sequence Spaces -- Data Management in Networks -- Edge-Isoperimetric Problems for Cartesian Powers of Regular Graphs -- Approximate Constrained Bipartite Edge Coloring -- Maximum Clique Transversals -- On the Tree-Degree of Graphs -- On Constrained Minimum Vertex Covers of Bipartite Graphs: Improved Algorithms -- (k+) -Disatance- Herediatry Graphs -- On the Relationship between Clique-Width and Treewidth -- Planarity of the 2-Level Cactus Model -- Estimating All Pairs Shortest Paths in Restricted Graph Families: A Unified Approach -- How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time -- (g, f)-Factorizations Orthogonal to k Subgraphs -- On Star Coloring of Graphs -- Graph Subcolorings: Complexity and Algorithms -- Approximation of Pathwidth of Outerplanar Graphs -- On the Monotonicity of Games Generated by Symmetric Submodular Functions -- Multiple Hotlink Assignment -- Small k-Dominating Sets in Planar Graphs with Applications -- Lower Bounds for Algorithms for the Steiner Tree Problem -- log n-Approximative NLCk-Decomposition in O(n 2k+1) Time -- On Subfamilies of AT-Free Graphs -- Complexity of Coloring Graphs without Forbidden Induced Subgraphs -- On Stable Cutsets in Line Graphs -- On Strong Menger-Connectivity of Star Graphs -- The Complexity of the Matching-Cut Problem -- De Bruijn Graphs and DNA Graphs -- A Generic Greedy Algorithm, Partially-Ordered Graphs and NP-Completeness -- Critical and Anticritical Edges in Perfect Graphs. |
| Record Nr. | UNINA-9910767577903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||