Výsledky vyhľadávania - "Linear-time algorithm"

A Linear-Time Algorithm for Influence Maximization Based on SCC-DAG

Autori: Choonghoon Park Kunsoo Park

Zdroj: KIISE Transactions on Computing Practices. 31:317-323

A linear time algorithm to compute vertices that belong to all, some and no minimum dominating sets in a tree and its consequences

Autori: Radosław Ziemann Paweł Żyliński

Zdroj: Opuscula Mathematica, Vol 45, Iss 6, Pp 841-855 (2025)

Predmety: tree, domination, independence, vertex cover, dissociation, algorithm, linear time, dynamic programming, Applied mathematics. Quantitative methods, T57-57.97

Popis súboru: electronic resource

Relation: https://www.opuscula.agh.edu.pl/vol45/6/art/opuscula_math_4540.pdf; https://doaj.org/toc/1232-9274

Prístupová URL adresa: https://doaj.org/article/acfcc7b46514466d95f537956725c768

A near-linear time algorithm and a min-cost flow approach for determining the optimal landing times of a fixed sequence of planes

Autori: Bin Cao Chao Xu

Zdroj: Annals of Operations Research. 344:479-498

A linear-time algorithm to compute the conjugate of nonconvex bivariate piecewise linear-quadratic functions

Autori: Tanmaya Karmarkar Yves Lucet

Zdroj: Journal of Global Optimization.

Predmety: Computer Science - Symbolic Computation, FOS: Computer and information sciences, Optimization and Control (math.OC), FOS: Mathematics, 90C25, 65K10, 49M29, 26B25, Symbolic Computation (cs.SC), Mathematics - Optimization and Control

Prístupová URL adresa: http://arxiv.org/abs/2505.06442

Linear-time algorithm for generating L-shaped floorplans using canonical ordering technique

Autori: null Shiksha Krishnendra Shekhawat Ritu Chandna a ďalší

Zdroj: Journal of Combinatorial Optimization. 49

A Linear Time Algorithm for the Maximum Overlap of Two Convex Polygons Under Translation

Autori: Chan, Timothy M. Hair, Isaac M. Timothy M. Chan and Isaac M. Hair

Prispievatelia: Chan, Timothy M. Hair, Isaac M. Timothy M. Chan and Isaac M. Hair

Predmety: Computational Geometry (cs.CG), FOS: Computer and information sciences, Convex polygons, shape matching, Computer Science - Computational Geometry, ddc:004, prune-and-search, parametric search

Popis súboru: application/pdf

Prístupová URL adresa: http://arxiv.org/abs/2504.18352
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2025.31

A linear-time algorithm for Chow decompositions

Autori: Blomenhofer, Alexander Taveira Lovitz, Benjamin

Predmety: FOS: Computer and information sciences, Quantum Physics, Data Structures and Algorithms, FOS: Mathematics, 14Q15, 15A69, FOS: Physical sciences, Data Structures and Algorithms (cs.DS), Quantum Physics (quant-ph), Algebraic Geometry, Algebraic Geometry (math.AG)

Prístupová URL adresa: http://arxiv.org/abs/2509.10450

A Structural Linear-Time Algorithm for Computing the Tutte Decomposition

Autori: Bourneuf, Romain Planken, Tim

Predmety: FOS: Computer and information sciences, Data Structures and Algorithms, Discrete Mathematics (cs.DM), Discrete Mathematics, Combinatorics, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO)

Prístupová URL adresa: http://arxiv.org/abs/2508.06212

A Linear Time Algorithm for Finding Minimum Flip Sequences between Plane Spanning Paths in Convex Point Sets

Autori: Aichholzer, Oswin Dorfer, Joseph

Predmety: Computational Geometry (cs.CG), FOS: Computer and information sciences, Computational Geometry

Prístupová URL adresa: http://arxiv.org/abs/2507.02740

A Practical Linear Time Algorithm for Optimal Tree Decomposition of Halin Graphs

Autori: Alejandro-Soto, J. A. Trejo-Sanchez, Joel Antonio Segura, Carlos

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/2506.02346

Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm

Autori: Biedl, Therese

Predmety: FOS: Computer and information sciences, Data Structures and Algorithms, Combinatorics, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO)

Prístupová URL adresa: http://arxiv.org/abs/2508.11444

A LINEAR-TIME ALGORITHM FOR COMPLEX TRUST REGION SUBPROBLEM WITH A LINEAR CUT

Autori: Yang Meijia Zhang Hanxiao Xu Zhuoyi a ďalší

Zdroj: Pacific Journal of Optimization.

A linear-time algorithm for semitotal domination in strongly chordal graphs

Autori: Tripathi, Vikash Pandey, Arti Maheshwari, Anil

Zdroj: Discrete Applied Mathematics. 338:77-88

Predmety: FOS: Computer and information sciences, Discrete Mathematics (cs.DM), FOS: Mathematics, 0211 other engineering and technologies, Mathematics - Combinatorics, Combinatorics (math.CO), 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Computer Science - Discrete Mathematics

Prístupová URL adresa: http://arxiv.org/abs/2109.02142

A linear-time algorithm computing the resident fitness in interacting trajectories

Autori: Friedl, Katalin Nemkin, Viktória Tóbiás, András

Témy: Computer Science - Data Structures and Algorithms, Mathematics - Probability, 68Q25, 68W40, 60K05, 92D15, text

URL: http://arxiv.org/abs/2502.11561

A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow

Autori: Brand, Jan van den Chen, Li Kyng, Rasmus a ďalší

Zdroj: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS). :503-514

Predmety: FOS: Computer and information sciences, Optimization and Control (math.OC), Computer Science - Data Structures and Algorithms, FOS: Mathematics, Data Structures and Algorithms (cs.DS), Mathematics - Optimization and Control

Prístupová URL adresa: http://arxiv.org/abs/2309.16629

A linear time algorithm for linearizing quadratic and higher-order shortest path problems

Autori: Eranda Çela Bettina Klinz Stefan Lendl a ďalší

Zdroj: Lecture Notes in Computer Science ISBN: 9783031327254
Math Program
Mathematical programming 210(1/2), 165-188 (2024). doi:10.1007/s10107-024-02086-z special issue: "Special Issue: Integer Programming and Combinatorial Optimization (IPCO) 2023 / Issue Editors: Alberto Del Pia, Volker Kaibel"

Predmety: FOS: Computer and information sciences, F.2.2, G.2.2, Full Length Paper, 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: https://pubmed.ncbi.nlm.nih.gov/40026607
http://arxiv.org/abs/2303.00569
https://publications.rwth-aachen.de/record/991003

A simpler linear-time algorithm for the common refinement of rooted phylogenetic trees on a common leaf set

Autori: Schaller, David Hellmuth, Marc Stadler, Peter F.

Zdroj: Algorithms for Molecular Biology. 16

Predmety: Mathematical phylogenetics, Rooted trees, Compatibility of rooted trees

Popis súboru: print

Prístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-199756
https://doi.org/10.1186/s13015-021-00202-8

Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding

Autori: Klaus Jansen Alexandra Lassota Lars Rohwedder a ďalší

Prispievatelia: Klaus Jansen Alexandra Lassota Lars Rohwedder 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

Mutual-visibility in distance-hereditary graphs: a linear-time algorithm

Autori: Cicerone S. Di Stefano G.

Zdroj: Procedia Computer Science. 223:104-111

Predmety: FOS: Computer and information sciences, G.2.2, F.2.2, G.2.1, Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO)

Prístupová URL adresa: http://arxiv.org/abs/2307.10661
https://hdl.handle.net/11697/217319
https://doi.org/10.1016/j.procs.2023.08.219

An almost linear time algorithm testing whether the Markoff graph modulo p is connected

Autori: Colby Austin Brown

Zdroj: Research in Number Theory. 11

Predmety: Mathematics - Number Theory, 0101 mathematics, 11Y16, 01 natural sciences

Prístupová URL adresa: http://arxiv.org/abs/2401.00630