Suchergebnisse - "Linear Time Algorithms"

Solving NP-hard problems on GATEX graphs: Linear-time algorithms for perfect orderings, cliques, colorings, and independent sets

Autoren: Hellmuth, Marc Scholz, Guillaume E.

Quelle: Theoretical Computer Science. 1037

Schlagwörter: Cograph, Galled-tree, Linear-time algorithms, Modular decomposition, NP-hard problems

Dateibeschreibung: print

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-241848
https://doi.org/10.1016/j.tcs.2025.115157

Semi-streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints

Autoren: Chien-Chung Huang François Sellier Huang, Chien-Chung

Weitere Verfasser: Chien-Chung Huang François Sellier Huang, Chien-Chung

Quelle: Algorithmica. 86:3598-3628

Schlagwörter: FOS: Computer and information sciences, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching submodular function maximization streaming matroid matchoid, sublinear and near linear time algorithms, 0211 other engineering and technologies, 2012 ACM Subject Classification Theory of computation → Streaming sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching, 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 2012 ACM Subject Classification Theory of computation → Streaming, matchoid, 01 natural sciences, Computer Science - Data Structures and Algorithms, matroid, Data Structures and Algorithms (cs.DS), streaming, submodular function maximization

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2107.13071
https://hal.science/hal-03982431v1

Linear-Time Multilevel Graph Partitioning via Edge Sparsification

Autoren: Gottesbüren, Lars Maas, Nikolai Rosch, Dominik et al.

Weitere Verfasser: Gottesbüren, Lars Maas, Nikolai Rosch, Dominik et al.

Schlagwörter: FOS: Computer and information sciences, Linear Time Algorithms, Graph Partitioning, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), Graph Algorithms, ddc:004, Graph Sparsification

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2504.17615
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.32

Realization of Temporally Connected Graphs Based on Degree Sequences

Autoren: Casteigts, Arnaud Döring, Michelle Morawietz, Nils et al.

Weitere Verfasser: Casteigts, Arnaud Döring, Michelle Morawietz, Nils et al.

Schlagwörter: temporal paths, gossiping, (multi)graphical degree sequences, edge-disjoint spanning trees, linear time algorithms

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 359, 36th International Symposium on Algorithms and Computation (ISAAC 2025); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.17

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.ISAAC.2025.17
https://nbn-resolving.org/urn:nbn:de:0030-drops-249256
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2025.17

Testing Depth First Search Numbering

Autoren: Czumaj, Artur Sohler, Christian Walzer, Stefan

Schlagwörter: Randomized Algorithms, Graph Algorithms, Property Testing, Theory of computation → Streaming, sublinear and near linear time algorithms, ddc:004, DATA processing & computer science, info:eu-repo/classification/ddc/004

Dateibeschreibung: application/pdf

Relation: info:eu-repo/semantics/altIdentifier/isbn/978-3-95977-395-9; https://publikationen.bibliothek.kit.edu/1000185667; https://publikationen.bibliothek.kit.edu/1000185667/167997099; https://doi.org/10.5445/IR/1000185667

Verfügbarkeit: https://publikationen.bibliothek.kit.edu/1000185667
https://publikationen.bibliothek.kit.edu/1000185667/167997099
https://doi.org/10.5445/IR/1000185667

On Time-Sensitive Control Closure for Secure Information Flow

Autoren: Masud, Abu Naser Lisper, Björn

Quelle: Lecture Notes in Computer Science. :120-137

Schlagwörter: Benchmarking, Data flow graphs, Data integrity, Data transfer, Graph algorithms, Information management, Program compilers, Sensitive data, Dependency analysis, Information flow control, Linear-time algorithms, Program execution, Secret data, Secret information, Secure information flow, Sensitive informations, Static program, Timing channels, Information leakage

Dateibeschreibung: print

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-70995

Computing Bend-Minimum Orthogonal Drawings of Plane Series–Parallel Graphs in Linear Time

Autoren: Didimo W. Kaufmann M. Liotta G. et al.

Quelle: Algorithmica. 85:2605-2666

Schlagwörter: Linear-time algorithms, Plane graphs, Computational Geometry (cs.CG), FOS: Computer and information sciences, Bend minimization, Series–parallel graphs, Computer Science - Data Structures and Algorithms, Orthogonal drawings, Computer Science - Computational Geometry, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, 01 natural sciences

Zugangs-URL: http://arxiv.org/abs/2205.07500
https://hdl.handle.net/11391/1553147
https://doi.org/10.1007/s00453-023-01110-6

Buffered Streaming Edge Partitioning

Autoren: Chhabra, Adil Fonseca Faraj, Marcelo Schulz, Christian et al.

Weitere Verfasser: Chhabra, Adil Fonseca Faraj, Marcelo Schulz, Christian et al.

Schlagwörter: ddc:004, graph partitioning, DATA processing & computer science, sublinear and near linear time algorithms, Theory of computation → Streaming, edge partitioning, buffered partitioning, Theory of computation → Graph algorithms analysis, Computer Science - Data Structures and Algorithms, streaming, online

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2402.11980
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2024.5
https://publikationen.bibliothek.kit.edu/1000173355
https://doi.org/10.5445/IR/1000173355
https://publikationen.bibliothek.kit.edu/1000173355/154079176

On cherry-picking and network containment

Autoren: Remie Janssen Yukihiro Murakami

Quelle: Theoretical Computer Science. 856:121-150

Schlagwörter: Linear-time algorithms, 0301 basic medicine, Phylogenetic networks, 0303 health sciences, 03 medical and health sciences, Cherry-picking networks, Network containment, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), Tree containment, Cherry-picking sequences

Zugangs-URL: http://arxiv.org/abs/1812.08065
https://www.sciencedirect.com/science/article/pii/S0304397520307593
https://www.sciencedirect.com/science/article/abs/pii/S0304397520307593
https://www.narcis.nl/publication/RecordID/oai:tudelft.nl:uuid:6fdc6897-0883-4fc1-b3c3-f62477324d49
https://dblp.uni-trier.de/db/journals/tcs/tcs856.html#JanssenM21
http://resolver.tudelft.nl/uuid:6fdc6897-0883-4fc1-b3c3-f62477324d49

The Power of Linear-Time Data Reduction for Maximum Matching

Autoren: George B. Mertzios André Nichterlein Rolf Niedermeier et al.

Weitere Verfasser: George B. Mertzios André Nichterlein Rolf Niedermeier et al.

Quelle: Algorithmica, 2020, Vol.82(12), pp.3521-3565 [Peer Reviewed Journal]
Larsen, Kim G. & Bodlaender, Hans L. & Raskin, Jean-Francois (Eds.). (2017). 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) : August 21-25, 2017, Aalborg (Denmark) ; proceedings. Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, pp. 46, LIPIcs–Leibniz International Proceedings in Informatics(83)

Schlagwörter: FOS: Computer and information sciences, F.2.2, G.2.2, bipartite graphs, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, parameterized complexity analysis, 13. Climate action, FPT in P, Maximum-cardinality matching, kernelization, Computer Science - Data Structures and Algorithms, linear-time algorithms, Data Structures and Algorithms (cs.DS), ddc:004

Dateibeschreibung: application/pdf

Zugangs-URL: https://link.springer.com/content/pdf/10.1007/s00453-020-00736-0.pdf
http://arxiv.org/abs/1609.08879
https://link.springer.com/content/pdf/10.1007/s00453-020-00736-0.pdf
https://depositonce.tu-berlin.de/handle/11303/12830
https://dro.dur.ac.uk/31150/
https://link.springer.com/article/10.1007/s00453-020-00736-0
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica82.html#MertziosNN20
https://depositonce.tu-berlin.de/bitstream/11303/12830/1/Mertzios_etal_Power_2020.pdf
https://dro.dur.ac.uk/22113/
https://dblp.uni-trier.de/db/conf/mfcs/mfcs2017.html#MertziosNN17
https://drops.dagstuhl.de/opus/volltexte/2017/8116/pdf/LIPIcs-MFCS-2017-46.pdf/
http://dro.dur.ac.uk/22113/
https://doi.org/10.4230/LIPIcs.MFCS.2017.46
https://drops.dagstuhl.de/opus/volltexte/2017/8116/
https://www.arxiv.org/abs/1609.08879
https://ui.adsabs.harvard.edu/abs/2016arXiv160908879M/abstract
https://arxiv.org/pdf/1609.08879v3
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.46
http://dro.dur.ac.uk/22113/1/22113.pdf
https://doi.org/10.4230/LIPIcs.MFCS.2017.46
http://dro.dur.ac.uk/22113/
https://depositonce.tu-berlin.de/handle/11303/12830

Quantum Property Testing in Sparse Directed Graphs

Autoren: Apers, Simon Magniez, Frédéric Sen, Sayantan et al.

Weitere Verfasser: Apers, Simon Magniez, Frédéric Sen, Sayantan et al.

Quelle: 29th International Conference on Randomization and Computation
https://hal.science/hal-05343010
29th International Conference on Randomization and Computation, Aug 2025, Berkeley, United States. ⟨10.4230/LIPIcs.APPROX/RANDOM.2025.32⟩

Schlagwörter: Theory of computation → Quantum query complexity, sublinear and near linear time algorithms, Theory of computation → Streaming, collision finding, dual polynomial method, bounded-degree directed graphs, quantum computing, property testing, [INFO]Computer Science [cs]

Geographisches Schlagwort: Berkeley, United States

Relation: info:eu-repo/semantics/altIdentifier/arxiv/2410.05001; ARXIV: 2410.05001

Verfügbarkeit: https://hal.science/hal-05343010
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2025.32

Semi-Streaming Algorithms for Submodular Function Maximization Under b-Matching, Matroid, and Matchoid Constraints

Autoren: Huang, Chien-Chung Sellier, François École normale supérieure - Paris (ENS-PSL) et al.

Weitere Verfasser: Huang, Chien-Chung Sellier, François École normale supérieure - Paris (ENS-PSL) et al.

Quelle: APPROX/RANDOM ; https://hal.science/hal-03982431 ; APPROX/RANDOM, Aug 2021, Seattle, United States

Schlagwörter: 2012 ACM Subject Classification Theory of computation → Streaming sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching submodular function maximization streaming matroid matchoid, 2012 ACM Subject Classification Theory of computation → Streaming, sublinear and near linear time algorithms, Theory of computation → Approximation algorithms analysis phrases Maximum weight matching, submodular function maximization, streaming, matroid, matchoid, [INFO]Computer Science [cs]

Geographisches Schlagwort: Seattle, United States

Verfügbarkeit: https://hal.science/hal-03982431
https://hal.science/hal-03982431v1/document
https://hal.science/hal-03982431v1/file/2107.13071.pdf

Fully Dynamic Approximate k-Core Decomposition in Hypergraphs

Autoren: Bintao Sun T. -H. Hubert Chan Mauro Sozio

Quelle: ACM Transactions on Knowledge Discovery from Data. 14:1-21

Schlagwörter: Network algorithms, Theory of computation, Online algorithms, Streaming, sublinear and near linear time algorithms, Core values, dynamic network, hypergraphs, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, 16. Peace & justice

Dateibeschreibung: application/pdf

Folding Every Point on a Polygon Boundary to a Point

Autoren: Nattawut Phetmak Jittat Fakcharoenphol

Quelle: Algorithms, Vol 16, Iss 6, p 281 (2023)

Schlagwörter: geometric folding, parabola intersection, computational origami, linear-time algorithms, straight skeletons, Industrial engineering. Management engineering, T55.4-60.8, Electronic computers. Computer science, QA75.5-76.95

Relation: https://www.mdpi.com/1999-4893/16/6/281; https://doaj.org/toc/1999-4893; https://doaj.org/article/9aed67fc9f51401b8ae60e98667e50db

Verfügbarkeit: https://doi.org/10.3390/a16060281
https://doaj.org/article/9aed67fc9f51401b8ae60e98667e50db

Improved Sublinear-Time Edit Distance for Preprocessed Strings

Autoren: Bringmann, Karl Cassis, Alejandro Fischer, Nick et al.

Weitere Verfasser: Bringmann, Karl Cassis, Alejandro Fischer, Nick et al.

Quelle: 49th EATCS International Conference on Automata, Languages, and Programming
Leibniz International Proceedings in Informatics

Schlagwörter: Edit Distance, FOS: Computer and information sciences, Theory of computation → Streaming, sublinear and near linear time algorithms, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), 0102 computer and information sciences, ddc:004, Precision Sampling, Preprocessing, 01 natural sciences, Property Testing

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2204.14137
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2022.32
http://hdl.handle.net/21.11116/0000-000B-163A-C
http://hdl.handle.net/21.11116/0000-000B-163D-9

Algorithms for the Minimum Dominating Set Problem in Bounded Arboricity Graphs: Simpler, Faster, and Combinatorial

Autoren: Morgan, Adir Solomon, Shay Wein, Nicole et al.

Weitere Verfasser: Morgan, Adir Solomon, Shay Wein, Nicole et al.

Schlagwörter: Graph Algorithms, Dominating Set, Bounded Arboricity, Linear time algorithms

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 209, 35th International Symposium on Distributed Computing (DISC 2021); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.33

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.DISC.2021.33
https://nbn-resolving.org/urn:nbn:de:0030-drops-148353
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.33

Sliding Window Property Testing for Regular Languages

Autoren: Ganardi, Moses Hucke, Danny Lohrey, Markus et al.

Weitere Verfasser: Ganardi, Moses Hucke, Danny Lohrey, Markus et al.

Quelle: 30th International Symposium on Algorithms and Computation (ISAAC 2019)
https://hal.science/hal-03942948
30th International Symposium on Algorithms and Computation (ISAAC 2019), 2019, ShangHai, China. ⟨10.4230/LIPIcs.ISAAC.2019.6⟩

Schlagwörter: 2012 ACM Subject Classification Theory of computation → Streaming sublinear and near linear time algorithms phrases Streaming algorithms approximation algorithms regular languages, 2012 ACM Subject Classification Theory of computation → Streaming, sublinear and near linear time algorithms phrases Streaming algorithms, approximation algorithms, regular languages, [INFO]Computer Science [cs]

Geographisches Schlagwort: ShangHai, China

Relation: hal-03942948; https://hal.science/hal-03942948; https://hal.science/hal-03942948/document; https://hal.science/hal-03942948/file/LIPIcs-ISAAC-2019-6.pdf

Verfügbarkeit: https://hal.science/hal-03942948
https://hal.science/hal-03942948/document
https://hal.science/hal-03942948/file/LIPIcs-ISAAC-2019-6.pdf
https://doi.org/10.4230/LIPIcs.ISAAC.2019.6

Linear Kernels and Linear-Time Algorithms for Finding Large Cuts

Autoren: Michael Etscheid Matthias Mnich Michael Etscheid and Matthias Mnich

Weitere Verfasser: Michael Etscheid Matthias Mnich Michael Etscheid and Matthias Mnich

Quelle: Algorithmica. 80:2574-2615

Schlagwörter: Linear-time algorithms, COMPLEXITY, 0102 computer and information sciences, 01 natural sciences, HALF, Informatik, fixed-parameter tractability, Fixed-parameter tractability, kernelization, Max-cut, Max-Cut, Kernelization, MAX-CUT, ddc:004

Dateibeschreibung: application/pdf

Zugangs-URL: https://link.springer.com/content/pdf/10.1007/s00453-017-0388-z.pdf
https://cris.maastrichtuniversity.nl/en/publications/191bb6b0-6cf9-4ec5-9807-901dec7bb3ef
https://doi.org/10.4230/LIPIcs.ISAAC.2016.31
https://rd.springer.com/article/10.1007/s00453-017-0388-z
https://link.springer.com/article/10.1007/s00453-017-0388-z
https://core.ac.uk/display/132740168
https://doi.org/10.1007/s00453-017-0388-z
https://link.springer.com/content/pdf/10.1007/s00453-017-0388-z.pdf
https://link.springer.com/article/10.1007/s00453-017-0388-z/fulltext.html
https://drops.dagstuhl.de/opus/volltexte/2016/6801/
https://doi.org/10.4230/LIPIcs.ISAAC.2016.31
https://drops.dagstuhl.de/opus/volltexte/2016/6801/pdf/LIPIcs-ISAAC-2016-31.pdf/
https://dblp.uni-trier.de/db/conf/isaac/isaac2016.html#EtscheidM16
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2016.31

enTesting Distributions of Huge Objects

Autoren: Goldreich, Oded Ron, Dana Braverman, Mark

Weitere Verfasser: Goldreich, Oded Ron, Dana Braverman, Mark

Schlagwörter: Theory of computation → Streaming, sublinear and near linear time algorithms, Distributions, Property Testing

The geodesic 2-center problem in a simple polygon

Autoren: Oh, Eunjin De Carufel, Jean-Lou Ahn, Hee-Kap

Weitere Verfasser: Oh, Eunjin De Carufel, Jean-Lou Ahn, Hee-Kap

Quelle: Computational Geometry. 74:21-37

Schlagwörter: LINEAR-TIME ALGORITHMS, Computational Geometry (cs.CG), FOS: Computer and information sciences, Geodesic distance, Simple polygons, Computer Science - Computational Geometry, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, k-center problem

Zugangs-URL: http://arxiv.org/pdf/1710.09035
http://arxiv.org/abs/1710.09035
https://arxiv.org/abs/1710.09035
https://www.sciencedirect.com/science/article/pii/S0925772118300853
https://dblp.uni-trier.de/db/journals/corr/corr1710.html#abs-1710-09035
http://ui.adsabs.harvard.edu/abs/2017arXiv171009035O/abstract