Search Results - "fully-dynamic algorithms"
-
1
Authors: et al.
Source: ACM Transactions on Algorithms
Subject Terms: FOS: Computer and information sciences, Computer Science - Machine Learning, Statistics - Machine Learning, Computer Science - Data Structures and Algorithms, Submodular Maximization, Matroids, Fully Dynamic Algorithms, 0211 other engineering and technologies, Data Structures and Algorithms (cs.DS), Machine Learning (stat.ML), 0102 computer and information sciences, 02 engineering and technology, submodular maximization, fully dynamic, 01 natural sciences, Machine Learning (cs.LG)
File Description: application/pdf
-
2
Authors: et al.
Contributors: et al.
Source: van der Hoog, I, Nusser, A, Rotenberg, E & Staals, F 2024, ' Fully-Adaptive Dynamic Connectivity of Square Intersection Graphs ', Leibniz International Proceedings in Informatics, LIPIcs, vol. 306, 63 . https://doi.org/10.4230/LIPIcs.MFCS.2024.63
Subject Terms: Computational Geometry (cs.CG), FOS: Computer and information sciences, Data structures, Fully-dynamic algorithms, planar geometry, Computational geometry, Planar geometry, data structures, Geometric intersection graphs, [INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG], fully-dynamic algorithms, geometric intersection graphs, computational geometry, Computer Science - Computational Geometry, ddc:004
File Description: application/pdf
Access URL: http://arxiv.org/abs/2406.20065
https://hal.science/hal-04837154v1
https://hal.science/hal-04837154v1/document
https://doi.org/10.4230/lipics.mfcs.2024.63
https://orbit.dtu.dk/en/publications/4d91d716-66c8-432a-b252-ae2be4d15016
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.63 -
3
Authors: et al.
Contributors: et al.
Subject Terms: Fully dynamic algorithms, knapsack problem, approximation schemes
File Description: application/pdf
Relation: Is Part Of LIPIcs, Volume 213, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2021.18
-
4
Authors: et al.
Contributors: et al.
Subject Terms: FOS: Computer and information sciences, Computer Science - Data Structures and Algorithms, approximation schemes, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, knapsack problem, ddc:004, [INFO] Computer Science [cs], 01 natural sciences, Fully dynamic algorithms
File Description: application/pdf
-
5
Authors:
Source: SIAM Journal on Computing
Subject Terms: FOS: Computer and information sciences, Dynamic data structures, Fully dynamic algorithms, Maximum matching, Minimum vertex conver, Primal-dual method, Computer Science (all), Mathematics (all), ALGORITHMS, minimum vertex conver, 0102 computer and information sciences, dynamic data structures, 01 natural sciences, primal-dual method, maximum matching, 102031 Theoretische Informatik, 102031 Theoretical computer science, Computer Science - Data Structures and Algorithms, fully dynamic algorithms, Data Structures and Algorithms (cs.DS), QA
File Description: application/pdf
Access URL: http://arxiv.org/pdf/1412.1318
https://epubs.siam.org/doi/pdf/10.1137/1.9781611973730.54
http://arxiv.org/abs/1412.1318
http://wrap.warwick.ac.uk/122932/1/WRAP-deterministic-fully -dynamic -data-structures-vertex-cover-Bhattacharya-2018.pdf
http://wrap.warwick.ac.uk/92706/1/WRAP-deterministic-fully -dynamic -data-structures-Bhattacharya-2015.pdf
https://epubs.siam.org/doi/abs/10.1137/140998925
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp47.html#BhattacharyaHI18
https://iris.luiss.it/handle/11385/182812
https://art.torvergata.it/handle/2108/115644
https://dl.acm.org/doi/10.5555/2722129.2722183
https://dblp.uni-trier.de/db/journals/corr/corr1412.html#BhattacharyaHI14
https://arxiv.org/pdf/1412.1318
http://eprints.cs.univie.ac.at/4157/1/camera.pdf
https://hdl.handle.net/2108/115644
https://doi.org/10.1137/1.9781611973730.54 -
6
Authors:
Contributors:
Source: Discrete Applied Mathematics. 160:708-733
Subject Terms: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), Applied Mathematics, 0211 other engineering and technologies, G.2.1, G.2.2, 0102 computer and information sciences, 02 engineering and technology, Split decomposition, 01 natural sciences, Distance hereditary graphs, Fully dynamic algorithms, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Computer Science - Data Structures and Algorithms, Discrete Mathematics and Combinatorics, Data Structures and Algorithms (cs.DS), Computer Science - Discrete Mathematics
Access URL: http://arxiv.org/abs/0810.1823
-
7
Authors:
Source: Lecture Notes in Computer Science ISBN: 9783540662518
Subject Terms: graph algorithms, proper interval graphs, lower bounds, Analysis of algorithms and problem complexity, Graph algorithms (graph-theoretic aspects), Analysis of algorithms, fully dynamic algorithms, 0102 computer and information sciences, 01 natural sciences
File Description: application/xml
Access URL: http://www.cs.tau.ac.il/~roded/articles/
dynamic .pdf
http://www.math.tau.ac.il/~roded/articles/dynamic .pdf
https://epubs.siam.org/doi/abs/10.1137/S0097539700372216
https://doi.org/10.1137/S0097539700372216
http://www.cs.haifa.ac.il/~golumbic/courses/seminar-2013graph/hell-shamir-sharan-unit-interval-ESA99.pdf
https://locus.siam.org/doi/abs/10.1137/S0097539700372216
https://dblp.uni-trier.de/db/journals/siamcomp/siamcomp31.html#HellSS01
https://dblp.uni-trier.de/db/conf/esa/esa99.html#HellSS99
http://core.ac.uk/display/23583992
https://link.springer.com/chapter/10.1007%2F3-540-48481-7_46
https://rd.springer.com/chapter/10.1007/3-540-48481-7_46
https://link.springer.com/content/pdf/10.1007%2F3-540-48481-7_46.pdf -
8
Authors:
Source: Journal of Algorithms. 34:251-281
Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, fully dynamic algorithms, 02 engineering and technology, Nonnumerical algorithms
File Description: application/xml
Access URL: https://zbmath.org/1415602
https://doi.org/10.1006/jagm.1999.1048
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=000084882600003&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=0c7ff228ccbaaa74236f48834a34396a
https://hdl.handle.net/11573/70301
https://doi.org/10.1006/jagm.1999.1048
https://hdl.handle.net/11697/6797
https://doi.org/10.1006/jagm.1999.1048 -
9
Authors: et al.
Contributors: et al.
Subject Terms: Fully Dynamic Algorithms, Graph Algorithms, Proper Interval Graphs, Lower Bounds
File Description: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.1344; http://fas.sfu.ca/cs/people/Faculty/Hell/pigs.ps
-
10
Authors: et al.
Contributors: et al.
Subject Terms: Fully Dynamic Algorithms, Graph Algorithms, Proper Interval Graphs, Lower Bounds
File Description: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.5530; http://fas.sfu.ca/1/cs/people/Faculty/pavol/pigs.ps
-
11
Authors: et al.
Contributors: et al.
Subject Terms: Key words. fully dynamic algorithms, graph algorithms, proper interval graphs, lower bounds
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.642.4522; http://www.cs.tau.ac.il/~roded/articles/dynamic_sicomp.pdf
-
12
Authors: et al.
Subject Terms: Fully Dynamic Algorithms, Sampling, Frequent Pattern Mining, Computer Science, Datalogi
File Description: electronic
-
13
Authors: et al.
Subject Terms: Fully Dynamic Algorithms, Sampling, Frequent Pattern Mining, Computer Science, Datalogi
File Description: electronic
-
14
Authors: Soulignac, F.J.
-
15
Authors: et al.
Subject Terms: Fully Dynamic Algorithms, Sampling, Frequent Pattern Mining, Other Engineering and Technologies, Annan teknik
File Description: application/pdf
Availability: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-223354
-
16
Authors: et al.
Subject Terms: Fully Dynamic Algorithms, Sampling, Frequent Pattern Mining, Other Engineering and Technologies, Annan teknik
File Description: application/pdf
Availability: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-224143
-
17
Authors: Soulignac, Francisco Juan
Subject Terms: Co-connectivity, Dynamic recognition, Minimal forbidden induced subgraphs, Proper circular-arc graphs, Round graphs, Algorithms, Graphic methods, Connectivity algorithms, Decremental algorithms, Forbidden induced subgraphs, Fully dynamic algorithms, Induced subgraphs, Graph theory
Relation: https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_01784617_v71_n4_p904_Soulignac; https://hdl.handle.net/20.500.12110/paper_01784617_v71_n4_p904_Soulignac
-
18
Authors: et al.
-
19
Authors: et al.
-
20
Authors: et al.
Full Text Finder 
Nájsť tento článok vo Web of Science