Výsledky vyhľadávania - Near-Linear Time Algorithm
-
1
Autori:
Zdroj: Annals of Operations Research. 344:479-498
-
2
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: SIAM Journal on Discrete Mathematics. 34:2282-2299
Predmety: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, ddc:004, Near-Linear Time Algorithm, 01 natural sciences, n-fold ILP, Color Coding
Popis súboru: application/pdf
Prístupová URL adresa: https://drops.dagstuhl.de/opus/volltexte/2019/10651/pdf/LIPIcs-ICALP-2019-75.pdf
http://arxiv.org/abs/1811.00950
https://dblp.uni-trier.de/db/journals/corr/corr1811.html#abs-1811-00950
https://epubs.siam.org/doi/abs/10.1137/19M1303873
https://dblp.uni-trier.de/db/conf/icalp/icalp2019.html#JansenLR19
https://drops.dagstuhl.de/opus/volltexte/2019/10651/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.75 -
3
Autori:
Predmety: FOS: Computer and information sciences, CLUSTERING, SEMIRANDOM MODELS, FINE-GRAINED COMPLEXITY, MATRIX MULTPLICATIVE WEIGHTS, BALANCED CUT, SPARSEST CUT, Computer Science - Machine Learning, F.2, G.3, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Machine Learning (cs.LG)
-
4
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Robotics, Scheduling, Fine-grained complexity, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), ddc:004, Robotics (cs.RO), Approximation algorithms
Popis súboru: application/pdf
-
5
-
6
-
7
Autori:
Zdroj: IEEE 64th Annual Symposium on Foundations of Computer Science
64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)Predmety: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)
Popis súboru: application/pdf
-
8
Autori: a ďalší
Prispievatelia: a ďalší
Zdroj: Algorithmica, 86, 2152–2173
Predmety: ddc:004, DATA processing & computer science, split decomposition tree, 0102 computer and information sciences, 01 natural sciences, Simultaneous representation, recognition algorithm, Recognition, Geometric intersection graphs, Circle graphs, circle graphs, partial representation extension, 0101 mathematics
Popis súboru: application/pdf
Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2022.25
https://publikationen.bibliothek.kit.edu/1000170059/152665911
https://publikationen.bibliothek.kit.edu/1000170059
https://doi.org/10.5445/IR/1000170059
https://publikationen.bibliothek.kit.edu/1000151221/149398001
https://publikationen.bibliothek.kit.edu/1000151221
https://doi.org/10.5445/IR/1000151221 -
9
Autori: a ďalší
Predmety: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Machine Learning, Computer Science - Graphics, Computer Science - Data Structures and Algorithms, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), Graphics (cs.GR), Machine Learning (cs.LG)
Prístupová URL adresa: http://arxiv.org/abs/2307.03043
-
10
Autori: a ďalší
Prispievatelia: a ďalší
Predmety: FOS: Computer and information sciences, 2012 ACM Subject Classification Theory of computation → Shortest paths Single Source Shortest Paths Negative Weights Near-Linear Time Digital Object Identifier 10.4230/LIPIcs.SEA.2025.10, Theory of computation → Shortest paths, Single Source Shortest Paths, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Near-Linear Time, [INFO] Computer Science [cs], Negative Weights, Near-Linear Time Digital Object Identifier 10.4230/LIPIcs.SEA.2025.10, 2012 ACM Subject Classification Theory of computation → Shortest paths Single Source Shortest Paths
Popis súboru: application/pdf
-
11
Autori:
Zdroj: Annals of Operations Research; Jan2025, Vol. 344 Issue 1, p479-498, 20p
-
12
Autori: a ďalší
Zdroj: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977912
Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)Prístupová URL adresa: http://arxiv.org/abs/2401.05627
-
13
Autori:
Zdroj: SIAM journal on computing (Print). 52(2):112-127
Popis súboru: print
Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-331552
-
14
Autori:
Zdroj: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977912
Predmety: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS)
Prístupová URL adresa: http://arxiv.org/abs/2305.08434
-
15
Autori: a ďalší
Zdroj: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms ISBN: 9781611975994
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete AlgorithmsPredmety: ta113, FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences
Prístupová URL adresa: https://epubs.siam.org/doi/pdf/10.1137/1.9781611975994.126
http://arxiv.org/abs/1910.14344
http://juuli.fi/Record/0369264820
https://doi.org/10.1137/1.9781611975994.126
https://arxiv.org/abs/1910.14344
https://research.aalto.fi/en/publications/computing-and-testing-small-connectivity-in-near -linear -time -and-
http://dblp.uni-trier.de/db/journals/corr/corr1910.html#abs-1910-14344
http://arxiv.org/pdf/1910.14344.pdf
https://dblp.uni-trier.de/db/journals/corr/corr1910.html#abs-1910-14344
http://www.diva-portal.org/smash/record.jsf?pid=diva2:1453993 -
16
Autori:
Predmety: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0202 electrical engineering, electronic engineering, information engineering, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), 02 engineering and technology
Prístupová URL adresa: http://arxiv.org/abs/2111.15478
-
17
Autori:
Zdroj: Lecture Notes in Computer Science ISBN: 9783030617912
Predmety: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
Prístupová URL adresa: http://arxiv.org/pdf/1712.09166
http://arxiv.org/abs/1712.09166
https://dblp.uni-trier.de/db/journals/corr/corr1712.html#abs-1712-09166
https://arxiv.org/abs/1712.09166
https://arxiv.org/pdf/1712.09166.pdf
https://ui.adsabs.harvard.edu/abs/2017arXiv171209166D/abstract
https://rd.springer.com/chapter/10.1007/978-3-030-61792-9_2
https://link.springer.com/chapter/10.1007/978-3-030-61792-9_2 -
18
Additional Titles: En experimentell studie av en algorithm för att beräkna låg nodanslutning i nästan linjär tid
Autori: a ďalší
-
19
-
20
Autori:
Zdroj: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. :137-150
Predmety: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences
Prístupová URL adresa: http://arxiv.org/abs/2205.04636
Full Text Finder
Nájsť tento článok vo Web of Science