Articles liés à WALCOM: Algorithms and Computation : 15th International...

WALCOM: Algorithms and Computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021, Proceedings - Couverture souple

 
9783030682125: WALCOM: Algorithms and Computation : 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 - March 2, 2021, Proceedings

L'édition de cet ISBN n'est malheureusement plus disponible.

Synopsis

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

(Aucun exemplaire disponible)

Chercher:



Créez une demande

Vous ne trouvez pas le livre que vous recherchez ? Nous allons poursuivre vos recherches. Si l'un de nos libraires l'ajoute aux offres sur AbeBooks, nous vous le ferons savoir !

Créez une demande

Autres éditions populaires du même titre

9783030682101: WALCOM: Algorithms and Computation: 15th International Conference and Workshops, WALCOM 2021, Yangon, Myanmar, February 28 – March 2, 2021, Proceedings

Edition présentée

ISBN 10 :  3030682102 ISBN 13 :  9783030682101
Editeur : Springer, 2021
Couverture souple