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] ] : 44th International Workshop, WG 2018, Cottbus, Germany, June 27–29, 2018, Proceedings / / edited by Andreas Brandstädt, Ekkehard Köhler, Klaus Meer
| Graph-Theoretic Concepts in Computer Science [[electronic resource] ] : 44th International Workshop, WG 2018, Cottbus, Germany, June 27–29, 2018, Proceedings / / edited by Andreas Brandstädt, Ekkehard Köhler, Klaus Meer |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XIII, 384 p. 102 illus.) |
| Disciplina | 511.5 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Discrete mathematics Algorithms Artificial intelligence—Data processing Computer arithmetic and logic units Computer graphics Discrete Mathematics in Computer Science Data Science Arithmetic and Logic Structures Computer Graphics |
| ISBN | 3-030-00256-X |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On Dispersable Book Embeddings -- Characterising AT-free Graphs with BFS -- Edge Partitions of Optimal 2-plane and 3-plane Graphs -- On Minimum Connecting Transition Sets in Graphs -- Recognizing Hyperelliptic Graphs in Polynomial Time -- On Directed Feedback Vertex Set Parameterized by Treewidth -- Optimality Program in Segment and String Graphs -- Anagram-Free Chromatic Number is Not Pathwidth-Bounded -- Tight Lower Bounds for the Number of st-Cuts -- Sub-exponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity -- Computing Small Pivot-Minors -- Saving Probe Bits by Cube Domination -- Graph Amalgamation under Logical Constraints -- Optimal General Matchings -- Quasimonotone Graphs -- Equiangular Polygon Contact Representations -- Temporal Graph Classes: A View Through Temporal Separators -- Covering A Graph with Nontrivial Vertex-disjoint Paths: Existence and Optimization -- On the Relation of Strong Triadic Closure and Cluster Deletion -- On Perfect Linegraph Squares -- On Weak Isomorphism of Rooted Vertex-Colored Graphs -- Connected Vertex Cover for (sP_1+P_5)-Free Graphs -- Structurally Parameterized d-Scattered Set -- Popular Matchings of Desired Size -- Convexity-Increasing Morphs of Planar Graphs -- Treedepth Bounds in Linear Colorings -- An Improved FPT lgorithm for Independent Feedback Vertex Set -- Construction and Local Routing for Angle-Monotone Graphs -- Characterization and Recognition of Tree 3-Spanner dmissible Directed Path Graphs of Diameter Three. . |
| Record Nr. | UNISA-996466363303316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Graph-Theoretic Concepts in Computer Science : 44th International Workshop, WG 2018, Cottbus, Germany, June 27–29, 2018, Proceedings / / edited by Andreas Brandstädt, Ekkehard Köhler, Klaus Meer
| Graph-Theoretic Concepts in Computer Science : 44th International Workshop, WG 2018, Cottbus, Germany, June 27–29, 2018, Proceedings / / edited by Andreas Brandstädt, Ekkehard Köhler, Klaus Meer |
| Edizione | [1st ed. 2018.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 |
| Descrizione fisica | 1 online resource (XIII, 384 p. 102 illus.) |
| Disciplina |
511.5
004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science - Mathematics
Discrete mathematics Algorithms Artificial intelligence - Data processing Computer arithmetic and logic units Computer graphics Discrete Mathematics in Computer Science Data Science Arithmetic and Logic Structures Computer Graphics |
| ISBN | 3-030-00256-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | On Dispersable Book Embeddings -- Characterising AT-free Graphs with BFS -- Edge Partitions of Optimal 2-plane and 3-plane Graphs -- On Minimum Connecting Transition Sets in Graphs -- Recognizing Hyperelliptic Graphs in Polynomial Time -- On Directed Feedback Vertex Set Parameterized by Treewidth -- Optimality Program in Segment and String Graphs -- Anagram-Free Chromatic Number is Not Pathwidth-Bounded -- Tight Lower Bounds for the Number of st-Cuts -- Sub-exponential-Time and FPT Algorithms for Embedded Flat Clustered Planarity -- Computing Small Pivot-Minors -- Saving Probe Bits by Cube Domination -- Graph Amalgamation under Logical Constraints -- Optimal General Matchings -- Quasimonotone Graphs -- Equiangular Polygon Contact Representations -- Temporal Graph Classes: A View Through Temporal Separators -- Covering A Graph with Nontrivial Vertex-disjoint Paths: Existence and Optimization -- On the Relation of Strong Triadic Closure and Cluster Deletion -- On Perfect Linegraph Squares -- On Weak Isomorphism of Rooted Vertex-Colored Graphs -- Connected Vertex Cover for (sP_1+P_5)-Free Graphs -- Structurally Parameterized d-Scattered Set -- Popular Matchings of Desired Size -- Convexity-Increasing Morphs of Planar Graphs -- Treedepth Bounds in Linear Colorings -- An Improved FPT lgorithm for Independent Feedback Vertex Set -- Construction and Local Routing for Angle-Monotone Graphs -- Characterization and Recognition of Tree 3-Spanner dmissible Directed Path Graphs of Diameter Three. . |
| Record Nr. | UNINA-9910349407703321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2018 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||