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.
WALCOM: Algorithms and Computation [[electronic resource] ] : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings / / edited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy
| WALCOM: Algorithms and Computation [[electronic resource] ] : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings / / edited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (XV, 334 p. 108 illus., 55 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Data structures (Computer science) Information theory Computer science - Mathematics Discrete mathematics Computer graphics Application software Theory of Computation Data Structures and Information Theory Discrete Mathematics in Computer Science Computer Graphics Computer and Information Systems Applications |
| ISBN | 3-030-68211-0 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited talks -- Majority Spanning Trees, Cotrees and Their Applications -- New Transportation Problem on a Graph with Sending and Bringing-Back Operations -- Long papers -- Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees -- On Short Fastest Paths in Temporal Graphs -- Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights -- The Bike Sharing Problem -- Efficient Generation of a Card-based Uniformly Distributed Random Derangement -- Compact Data Structures for Dedekind Groups and Finite Rings -- Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game -- Faster Multi-Sided Boundary Labelling -- On the Geometric Red-Blue Set Cover Problem -- Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes -- $r$-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes -- An Improvement of Reed's Treewidth Approximation -- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs -- Overall and delay complexity of the CLIQUESand Bron-Kerbosch algorithms -- Computing $L(p,1)$-Labeling with Combined Parameters -- On Compatible Matchings -- Upward Point Set Embeddings of Paths and Trees -- 2-colored Point-set Embeddings of Partial 2-trees -- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs -- APX-Hardness and Approximation for the $k$-Burning Number Problem -- Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs -- Physical Zero-Knowledge Proof for Ripple Effect -- Cyclic Shift Problems on Graphs -- Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles. |
| Record Nr. | UNISA-996464530003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
WALCOM: Algorithms and Computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings / / edited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy
| WALCOM: Algorithms and Computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings / / edited by Ryuhei Uehara, Seok-Hee Hong, Subhas C. Nandy |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (XV, 334 p. 108 illus., 55 illus. in color.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Data structures (Computer science) Information theory Computer science - Mathematics Discrete mathematics Computer graphics Application software Theory of Computation Data Structures and Information Theory Discrete Mathematics in Computer Science Computer Graphics Computer and Information Systems Applications |
| ISBN | 3-030-68211-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited talks -- Majority Spanning Trees, Cotrees and Their Applications -- New Transportation Problem on a Graph with Sending and Bringing-Back Operations -- Long papers -- Algorithms for Diameters of Unicycle Graphs and Diameter-Optimally Augmenting Trees -- On Short Fastest Paths in Temporal Graphs -- Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights -- The Bike Sharing Problem -- Efficient Generation of a Card-based Uniformly Distributed Random Derangement -- Compact Data Structures for Dedekind Groups and Finite Rings -- Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game -- Faster Multi-Sided Boundary Labelling -- On the Geometric Red-Blue Set Cover Problem -- Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes -- $r$-Gathering Problems on Spiders: Hardness, FPT Algorithms, and PTASes -- An Improvement of Reed's Treewidth Approximation -- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs -- Overall and delay complexity of the CLIQUESand Bron-Kerbosch algorithms -- Computing $L(p,1)$-Labeling with Combined Parameters -- On Compatible Matchings -- Upward Point Set Embeddings of Paths and Trees -- 2-colored Point-set Embeddings of Partial 2-trees -- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs -- APX-Hardness and Approximation for the $k$-Burning Number Problem -- Efficient Enumeration of Non-isomorphic Distance-Hereditary Graphs and Ptolemaic Graphs -- Physical Zero-Knowledge Proof for Ripple Effect -- Cyclic Shift Problems on Graphs -- Mathematical Characterizations and Computational Complexity of Anti-Slide Puzzles. |
| Record Nr. | UNINA-9910483831703321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||