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.
Algorithms and Complexity [[electronic resource] ] : 12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings / / edited by Tiziana Calamoneri, Federico Corò
| Algorithms and Complexity [[electronic resource] ] : 12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings / / edited by Tiziana Calamoneri, Federico Corò |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (XI, 410 p. 33 illus.) |
| Disciplina | 511.8 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer graphics Computer science—Mathematics Computer systems Artificial intelligence Design and Analysis of Algorithms Computer Graphics Symbolic and Algebraic Manipulation Computer System Implementation Artificial Intelligence |
| ISBN | 3-030-75242-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Abundant Extensions -- Three Problems on Well-Partitioned Chordal Graphs -- Distributed Distance-r Covering Problems on Sparse High-Girth Graphs -- Reconfiguration of Connected Graph Partitions via Recombination -- Algorithms for Energy Conservation in Heterogeneous Data Centers -- On Vertex-Weighted Graph Realizations -- On the Role of 3's for the 1-2-3 Conjecture -- Upper Tail Analysis of Bucket Sort and Random Tries -- Throughput Scheduling with Equal Additive Laxity -- Fragile Complexity of Adaptive Algorithms -- FPT and Kernelization Algorithms for the Induced Tree Problem -- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs -- Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation -- A Multistage View on 2-Satisfiability -- The Weisfeiler-Leman Algorithm and Recognition of Graph Properties -- The Parameterized Suffix Tray -- Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity -- Covering a Set of Line Segments with a Few Squares -- Circumventing Connectivity for Kernelization -- Online and Approximate Network Construction from Bounded Connectivity Constraints -- Globally Rigid Augmentation of Minimally Rigid Graphs in \(R^2\) -- Extending Partial Representations of Rectangular Duals with Given Contact Orientations -- Can Local Optimality be Used for Efficient Data Reduction -- Colouring Graphs of Bounded Diameter in the Absence of Small Cycles -- Online Two-Dimensional Vector Packing with Advice -- Temporal Matching on Geometric Graph Data. |
| Record Nr. | UNISA-996464433603316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Complexity : 12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings / / edited by Tiziana Calamoneri, Federico Corò
| Algorithms and Complexity : 12th International Conference, CIAC 2021, Virtual Event, May 10–12, 2021, Proceedings / / edited by Tiziana Calamoneri, Federico Corò |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (XI, 410 p. 33 illus.) |
| Disciplina | 511.8 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Algorithms
Computer graphics Computer science—Mathematics Computer systems Artificial intelligence Design and Analysis of Algorithms Computer Graphics Symbolic and Algebraic Manipulation Computer System Implementation Artificial Intelligence Algorismes Complexitat computacional |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN | 3-030-75242-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Abundant Extensions -- Three Problems on Well-Partitioned Chordal Graphs -- Distributed Distance-r Covering Problems on Sparse High-Girth Graphs -- Reconfiguration of Connected Graph Partitions via Recombination -- Algorithms for Energy Conservation in Heterogeneous Data Centers -- On Vertex-Weighted Graph Realizations -- On the Role of 3's for the 1-2-3 Conjecture -- Upper Tail Analysis of Bucket Sort and Random Tries -- Throughput Scheduling with Equal Additive Laxity -- Fragile Complexity of Adaptive Algorithms -- FPT and Kernelization Algorithms for the Induced Tree Problem -- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs -- Upper Dominating Set: Tight Algorithms for Pathwidth and Sub-Exponential Approximation -- A Multistage View on 2-Satisfiability -- The Weisfeiler-Leman Algorithm and Recognition of Graph Properties -- The Parameterized Suffix Tray -- Exploring the Gap Between Treedepth and Vertex Cover Through Vertex Integrity -- Covering a Set of Line Segments with a Few Squares -- Circumventing Connectivity for Kernelization -- Online and Approximate Network Construction from Bounded Connectivity Constraints -- Globally Rigid Augmentation of Minimally Rigid Graphs in \(R^2\) -- Extending Partial Representations of Rectangular Duals with Given Contact Orientations -- Can Local Optimality be Used for Efficient Data Reduction -- Colouring Graphs of Bounded Diameter in the Absence of Small Cycles -- Online Two-Dimensional Vector Packing with Advice -- Temporal Matching on Geometric Graph Data. |
| Record Nr. | UNINA-9910483444703321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||