المؤلفون: Bökler, Fritz, Chimani, Markus, Jasper, Henning, Wagner, Mirko H.

المساهمون: Fritz Bökler and Markus Chimani and Henning Jasper and Mirko H. Wagner

مصطلحات موضوعية: Graph spanners, ILP, algorithm engineering, experimental study

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.30

الاتاحة: https://doi.org/10.4230/LIPIcs.ESA.2024.30
https://nbn-resolving.org/urn:nbn:de:0030-drops-211012
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.30

المؤلفون: Petruschka, Asaf, Sapir, Shay, Tzalik, Elad

المساهمون: Asaf Petruschka and Shay Sapir and Elad Tzalik

مصطلحات موضوعية: Fault tolerance, Graph spanners

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.88

الاتاحة: https://doi.org/10.4230/LIPIcs.ITCS.2024.88
https://nbn-resolving.org/urn:nbn:de:0030-drops-196160
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2024.88

المؤلفون: Bilò, Davide, Gualà, Luciano, Leucci, Stefano, Straziota, Alessandro

المساهمون: Davide Bilò and Luciano Gualà and Stefano Leucci and Alessandro Straziota

مصطلحات موضوعية: Network sparsification, Graph spanners, Group Steiner tree, Distance oracles

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.25

الاتاحة: https://doi.org/10.4230/LIPIcs.ESA.2024.25
https://nbn-resolving.org/urn:nbn:de:0030-drops-210968
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.25

المؤلفون: Baligács, Júlia, Disser, Yann, Heinrich, Irene, Schweitzer, Pascal

المساهمون: Júlia Baligács and Yann Disser and Irene Heinrich and Pascal Schweitzer

مصطلحات موضوعية: online algorithms, competitive analysis, graph exploration, graph spanners, minor-free graphs, bounded genus graphs

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.11

الاتاحة: https://doi.org/10.4230/LIPIcs.ESA.2023.11
https://nbn-resolving.org/urn:nbn:de:0030-drops-186644
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.11

المؤلفون: Chimani, Markus, Stutzenstein, Finn

المساهمون: Markus Chimani and Finn Stutzenstein

مصطلحات موضوعية: Graph spanners, experimental study, algorithm engineering

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 244, 30th Annual European Symposium on Algorithms (ESA 2022); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.37

الاتاحة: https://doi.org/10.4230/LIPIcs.ESA.2022.37
https://nbn-resolving.org/urn:nbn:de:0030-drops-169750
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2022.37

المؤلفون: Fomin, Fedor V., Golovach, Petr A., Lochet, William, Misra, Pranabendu, Saurabh, Saket, Sharma, Roohani

المساهمون: Fedor V. Fomin and Petr A. Golovach and William Lochet and Pranabendu Misra and Saket Saurabh and Roohani Sharma

مصطلحات موضوعية: Graph spanners, directed graphs, parameterized complexity, kernelization

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 180, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.12

الاتاحة: https://doi.org/10.4230/LIPIcs.IPEC.2020.12
https://nbn-resolving.org/urn:nbn:de:0030-drops-133156
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.12

المؤلفون: Fernández V, Manuel, Woodruff, David P., Yasuda, Taisuke

المساهمون: Manuel Fernández V and David P. Woodruff and Taisuke Yasuda

مصطلحات موضوعية: Graph spanners, Message-passing model, Communication complexity

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 151, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.77

الاتاحة: https://doi.org/10.4230/LIPIcs.ITCS.2020.77
https://nbn-resolving.org/urn:nbn:de:0030-drops-117620
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.77

المؤلفون: Parter, Merav, Rubinfeld, Ronitt, Vakilian, Ali, Yodpinyanee, Anak

المساهمون: Merav Parter and Ronitt Rubinfeld and Ali Vakilian and Anak Yodpinyanee

مصطلحات موضوعية: Local Computation Algorithms, Sub-linear Algorithms, Graph Spanners

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 124, 10th Innovations in Theoretical Computer Science Conference (ITCS 2019); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.58

الاتاحة: https://doi.org/10.4230/LIPIcs.ITCS.2019.58
https://nbn-resolving.org/urn:nbn:de:0030-drops-101510
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2019.58

المؤلفون: Chlamtác, Eden, Dinitz, Michael

المساهمون: Eden Chlamtác and Michael Dinitz

مصطلحات موضوعية: Graph spanners, approximation algorithms, hardness of approximation

وصف الملف: application/pdf

Relation: Is Part Of LIPIcs, Volume 28, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)

الاتاحة: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.80
https://nbn-resolving.org/urn:nbn:de:0030-drops-46894
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.80

المؤلفون: Fomin, Fedor V., Golovach, Petr A., Lochet, William, Misra, Pranabendu, Saurabh, Saket, Sharma, Roohani

المصدر: Algorithmica
Leibniz International Proceedings in Informatics
12:1-12:11
15th International Symposium on Parameterized and Exact Computation

مصطلحات موضوعية: General Computer Science, Graph spanners, Mathematics of computing → Graph algorithms, Applied Mathematics, 0102 computer and information sciences, Computer Science::Computational Geometry, directed graphs, 01 natural sciences, Computer Science Applications, 010309 optics, 010201 computation theory & mathematics, kernelization, 0103 physical sciences, Theory of computation → Parameterized complexity and exact algorithms, Computer Science::Data Structures and Algorithms, parameterized complexity

وصف الملف: application/pdf

URL الوصول: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::088d929fc6922d54827b11f03ffff1f8
https://pubmed.ncbi.nlm.nih.gov/35880198

المؤلفون: Bilel Derbel, Cyril Gavoille, David Peleg, Laurent Viennot

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://www2.lifl.fr/~derbel/resources_publi/podc08.pdf.

مصطلحات موضوعية: distributed algorithms, graph spanners, time complexity

وصف الملف: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.572.2284; http://www2.lifl.fr/~derbel/resources_publi/podc08.pdf

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.572.2284
http://www2.lifl.fr/~derbel/resources_publi/podc08.pdf

المؤلفون: M. A. Rajan, M. Girish Ch, Lokanatha C. Reddy, Prakash Hiremath

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://www.journal.univagora.ro/download/pdf/327.pdf.

مصطلحات موضوعية: graphs, connectivity, graph spanners, proximity, MANET

وصف الملف: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.514.5774; http://www.journal.univagora.ro/download/pdf/327.pdf

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.514.5774
http://www.journal.univagora.ro/download/pdf/327.pdf

المؤلفون: Bilel Derbel, Cyril Gavoille

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://dept-info.labri.fr/~gavoille/article/DG08/.

مصطلحات موضوعية: Distributed algorithms, Graph spanners, Time complexity, Linial’s free model

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.396.5931; http://dept-info.labri.fr/~gavoille/article/DG08/

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.396.5931
http://dept-info.labri.fr/~gavoille/article/DG08/

المؤلفون: Bilel Derbel, Cyril Gavoille, David Peleg

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://www.liafa.jussieu.fr/~mairesse/MPRI/2008/disc.pdf.

مصطلحات موضوعية: distributed algorithms, graph spanners, time complexity. Submission, regular track

وصف الملف: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.9260; http://www.liafa.jussieu.fr/~mairesse/MPRI/2008/disc.pdf

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.9260
http://www.liafa.jussieu.fr/~mairesse/MPRI/2008/disc.pdf

المؤلفون: Bilel Derbel, Cyril Gavoille

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://www.springerlink.com/content/e45727wq820k40u5/fulltext.pdf.

مصطلحات موضوعية: Distributed algorithms, graph spanners, time complexity, Linial’s

وصف الملف: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.7944; http://www.springerlink.com/content/e45727wq820k40u5/fulltext.pdf

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.7944
http://www.springerlink.com/content/e45727wq820k40u5/fulltext.pdf

المؤلفون: Ulrik Brandes, Dagmar Handke

المصدر: Discrete Mathematics & Theoretical Computer Science, Vol Vol. 3 no. 1 (1998)

مصطلحات موضوعية: planar graphs, graph spanners, np-completeness, [info.info-dm] computer science [cs]/discrete mathematics [cs.dm], Mathematics, QA1-939

وصف الملف: electronic resource

Relation: https://dmtcs.episciences.org/257/pdf; https://doaj.org/toc/1365-8050

URL الوصول: https://doaj.org/article/f257cf2d83564f6b8572b3a2aac310b9

المؤلفون: Sandor P. Fekete, Jana Kremer

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: ftp://ftp.zpr.uni-koeln.de/pub/paper/zpr98-313a.ps.gz

مصطلحات موضوعية: graph spanners, planar graphs, distance in graphs, subgraphs, trees, complexity, polynomial algorithms

وصف الملف: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.9485

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.40.9485

المؤلفون: Wilhelmshavener Str, Erich Prisner, Mathematisches Seminar

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://lita.sciences.univ-metz.fr/~kratsch/publications/treespan.ps.

مصطلحات موضوعية: Key words, distance, graph spanners, spanning tree, algorithm, AT-free graph, distancehereditary graph, chordal graph, AMS subject classification, 05C12, 05C85, 68R10, 68Q20, 90B80

وصف الملف: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.3612; http://lita.sciences.univ-metz.fr/~kratsch/publications/treespan.ps

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.125.3612
http://lita.sciences.univ-metz.fr/~kratsch/publications/treespan.ps

المؤلفون: Brandes, Ulrik, Handke, Dagmar

المساهمون: Faculty of Mathematics and Computer Science Konstanz, University of Konstanz

المصدر: ISSN: 1462-7264.

مصطلحات موضوعية: planar graphs, graph spanners, NP-completeness, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]

Relation: hal-00958903; https://hal.inria.fr/hal-00958903; https://hal.inria.fr/hal-00958903/document; https://hal.inria.fr/hal-00958903/file/dm030101.pdf

الاتاحة: https://hal.inria.fr/hal-00958903
https://hal.inria.fr/hal-00958903/document
https://hal.inria.fr/hal-00958903/file/dm030101.pdf

المؤلفون: Guy Kortsarz, David Peleg

المساهمون: The Pennsylvania State University CiteSeerX Archives

المصدر: http://crab.rutgers.edu/~guyk/pub/bd2s/nabs.pdf.

مصطلحات موضوعية: Key words. graph spanners, NP-hardness, approximation, randomized rounding

وصف الملف: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.348.4752; http://crab.rutgers.edu/~guyk/pub/bd2s/nabs.pdf

الاتاحة: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.348.4752
http://crab.rutgers.edu/~guyk/pub/bd2s/nabs.pdf