Suchergebnisse - "linear-time algorithm"

Local antimagic labelling for trees

Autoren: Subhabrata Paul Soumen Raul

Quelle: Contributions to Mathematics, Vol 11, Pp 14-21 (2025)

Schlagwörter: linear-time algorithm, local antimagic labelling, QA1-939, Mathematics, tree

Zugangs-URL: https://doaj.org/article/2967d49510344e64920960790eaee6e4

Orthology and near-cographs in the context of phylogenetic networks

Autoren: Anna Lindeberg Guillaume E. Scholz Nicolas Wieseke et al.

Quelle: Algorithms for Molecular Biology, Vol 20, Iss 1, Pp 1-27 (2025)

Schlagwörter: Modular decomposition, Near cograph, Homology, Twin-width, Perfect graph, Linear-time algorithm, Biology (General), QH301-705.5, Genetics, QH426-470

Dateibeschreibung: electronic resource

Relation: https://doaj.org/toc/1748-7188

Zugangs-URL: https://doaj.org/article/6de0ebcf24144ff0b9ba236cdd7bf508

Dividing splittable goods evenly and with limited fragmentation

Autoren: Damaschke, Peter, 1963

Quelle: Algorithmica. 82(5):1298-1328

Schlagwörter: Approximation algorithm, Parameterized algorithm, Fair division, Weighted graph, Linear-time algorithm

Dateibeschreibung: electronic

Zugangs-URL: https://research.chalmers.se/publication/513743
https://research.chalmers.se/publication/513743/file/513743_Fulltext.pdf

A linear time approach to three-dimensional reconstruction by discrete tomography

Autoren: Ceko, Matthew Pagani, Silvia Maria Carla Tijdeman, Rob

Quelle: Contributions to Discrete Mathematics. 19:222-240

Schlagwörter: Ghost, Linear time algorithm, 52C07, 11H06, 68U10, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Mathematics - Combinatorics, Discrete tomography, 0102 computer and information sciences, 02 engineering and technology, Combinatorics (math.CO), Lattice direction, Three-dimensional reconstruction, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/2010.05868
https://cdm.ucalgary.ca/article/view/74134
https://hdl.handle.net/10807/297864
https://doi.org/10.55016/ojs/cdm.v19i3.74134

Orientation of Fitch Graphs and Reconciliation-Free Inference of Horizontal Gene Transfer in Gene Trees

Autoren: David Schaller Marc Hellmuth Peter F. Stadler

Quelle: SIAM Journal on Discrete Mathematics. 37:2172-2207

Schlagwörter: 101028 Mathematical modelling, 0301 basic medicine, 03 medical and health sciences, linear-time algorithm, 0206 medical engineering, 101028 Mathematische Modellierung, 02 engineering and technology, 102004 Bioinformatik, 102004 Bioinformatics, ANCESTORS

Zugangs-URL: https://ucrisportal.univie.ac.at/de/publications/c7a5da11-340c-407a-b92d-07fed89dd2cb

Medians in median graphs and their cube complexes in linear time

Autoren: Laurine Bénéteau Jérémie Chalopin Victor Chepoi et al.

Weitere Verfasser: Laurine Bénéteau Jérémie Chalopin Victor Chepoi et al.

Quelle: Journal of Computer and System Sciences. 126:80-105

Schlagwörter: FOS: Computer and information sciences, Median Problem, Discrete Mathematics (cs.DM), 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, CAT(0) Cube Complex, Linear Time Algorithm, 01 natural sciences, Median Graph, Computer Science - Data Structures and Algorithms, LexBFS, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), ddc:004, Computer Science - Discrete Mathematics

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/pdf/1907.10398
http://arxiv.org/abs/1907.10398
https://drops.dagstuhl.de/opus/volltexte/2020/12417/pdf/LIPIcs-ICALP-2020-10.pdf/
https://hal.archives-ouvertes.fr/hal-03047193/document
https://dblp.uni-trier.de/db/conf/icalp/icalp2020.html#BeneteauCCV20
https://hal.archives-ouvertes.fr/hal-03047193
https://drops.dagstuhl.de/opus/volltexte/2020/12417/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.10

Enhancing distance transform computation by leveraging the discrete nature of images

Autoren: Guillaume Fuseiller Romain Marie Gilles Mourioux et al.

Weitere Verfasser: Guillaume Fuseiller Romain Marie Gilles Mourioux et al.

Quelle: Journal of Real-Time Image Processing. 19:763-773

Schlagwörter: 2020 MSC: 68U10, Linear time algorithm, Distance transform, [INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV], 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Dynamic programming, 68U05, 94A08

Jointly stable matchings

Autoren: Shuichi Miyazaki Kazuya Okamoto Shuichi Miyazaki and Kazuya Okamoto et al.

Weitere Verfasser: Shuichi Miyazaki Kazuya Okamoto Shuichi Miyazaki and Kazuya Okamoto et al.

Quelle: Journal of Combinatorial Optimization. 38:646-665

Schlagwörter: Stable marriage problem, Linear time algorithm, stable matching, linear time algorithm, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, NP-completeness, 5. Gender equality, Stable matching, ddc:004, stable marriage problem

Dateibeschreibung: application/pdf

Zugangs-URL: https://drops.dagstuhl.de/opus/volltexte/2017/8224/pdf/LIPIcs-ISAAC-2017-56.pdf
https://drops.dagstuhl.de/opus/volltexte/2017/8224/
https://drops.dagstuhl.de/opus/volltexte/2017/8224/pdf/LIPIcs-ISAAC-2017-56.pdf/
http://drops.dagstuhl.de/opus/volltexte/2017/8224/pdf/LIPIcs-ISAAC-2017-56.pdf/
https://dblp.uni-trier.de/db/conf/isaac/isaac2017.html#MiyazakiO17
https://repository.kulib.kyoto-u.ac.jp/dspace/bitstream/2433/234947/1/LIPIcs-ISAAC-2017-56.pdf
http://dblp.uni-trier.de/db/conf/isaac/isaac2017.html#MiyazakiO17
https://link.springer.com/article/10.1007%2Fs10878-019-00402-4
https://dblp.uni-trier.de/db/journals/jco/jco38.html#MiyazakiO19
https://dl.acm.org/doi/abs/10.1007/s10878-019-00402-4
https://repository.kulib.kyoto-u.ac.jp/dspace/handle/2433/243846
https://ideas.repec.org/a/spr/jcomop/v38y2019i2d10.1007_s10878-019-00402-4.html
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.56

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

Autoren: Klaus Jansen Alexandra Lassota Lars Rohwedder et al.

Weitere Verfasser: Klaus Jansen Alexandra Lassota Lars Rohwedder et al.

Quelle: SIAM Journal on Discrete Mathematics. 34:2282-2299

Schlagwörter: 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

Dateibeschreibung: application/pdf

Zugangs-URL: 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

Strong Cliques in Diamond-Free Graphs

Autoren: Nina Chiarelli Berenice Martínez-Barona Martin Milanič et al.

Quelle: Lecture Notes in Computer Science ISBN: 9783030604394

Schlagwörter: CIS graph, Strong clique, NP-težek problem, strong clique, strongly perfect graph, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, algoritem linearne časovne zahtevnosti, 01 natural sciences, Polynomial-time algorithm, krepko popoln graf, Principes généraux des mathématiques, Diamond-free graph, Simplicial clique, lastnost Erdősa in Hajnala, FOS: Mathematics, Mathematics - Combinatorics, Maximal clique, simplicialna klika, maximal stable set, Maximal stable set, Erdős-Hajnal property, graf brez diamantov, maksimalna klika, polynomial-time algorithm, krepka klika, Strongly perfect graph, CIS graf, maximal clique, simplicial clique, diamond-free graph, linear-time algorithm, polinomski algoritem, maksimalna neodvisna množica, NP-hard problem, Combinatorics (math.CO)

Dateibeschreibung: text/url

Zugangs-URL: http://arxiv.org/pdf/2006.13822
http://arxiv.org/abs/2006.13822
https://link.springer.com/chapter/10.1007%2F978-3-030-60440-0_21
https://www.sciencedirect.com/science/article/pii/S0304397520307088
https://rd.springer.com/chapter/10.1007/978-3-030-60440-0_21
https://repozitorij.upr.si/IzpisGradiva.php?id=14263&lang=slv
https://dblp.uni-trier.de/db/journals/tcs/tcs858.html#ChiarelliMMMM21
https://hdl.handle.net/20.500.12556/RUP-14263
https://repozitorij.upr.si/IzpisGradiva.php?id=14263
https://doi.org/10.1007/978-3-030-60440-0_21

When was the Domestic PPI, CPI and Exchange Rate Balance Broken in Turkey? Breakpoint Detection in Cointegration Relationships

Autoren: CEYLAN, Özcan

Quelle: Volume: 11, Issue: 1 1-16
Optimum Journal of Economics and Management Sciences
Optimum Ekonomi ve Yönetim Bilimleri Dergisi

Schlagwörter: Cointegration, Inflation, Exchange Rate, Pruned Exact Linear Time Algorithm, Eşbütünleşme, Enflasyon, Döviz Kuru, Budanmış Kesin Doğrusal Zaman Algoritması

Dateibeschreibung: application/pdf

Zugangs-URL: https://dergipark.org.tr/tr/pub/optimum/issue/82627/1309492

Bundled Crossings Revisited

Autoren: Steven Chaplick Thomas C. van Dijk Myroslav Kryven et al.

Weitere Verfasser: Steven Chaplick Thomas C. van Dijk Myroslav Kryven et al.

Quelle: Lecture Notes in Computer Science ISBN: 9783030358013

Schlagwörter: Computational Geometry (cs.CG), FOS: Computer and information sciences, GENUS, LINEAR-TIME ALGORITHM, [INFO.INFO-CG] Computer Science [cs]/Computational Geometry [cs.CG], EMBEDDING GRAPHS, 0202 electrical engineering, electronic engineering, information engineering, VISUALIZATION, Computer Science - Computational Geometry, 02 engineering and technology, 0102 computer and information sciences, [INFO] Computer Science [cs], 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/pdf/1812.04263
http://arxiv.org/abs/1812.04263
https://inria.hal.science/hal-02972975v1/document
https://doi.org/10.7155/jgaa.00534
https://inria.hal.science/hal-02972975v1
https://www.arxiv-vanity.com/papers/1812.04263/
http://doi.org/10.1007/978-3-030-35802-0_5
https://arxiv.org/pdf/1812.04263
https://dblp.uni-trier.de/db/journals/corr/corr1812.html#abs-1812-04263
https://www.narcis.nl/publication/RecordID/oai%3Acris.maastrichtuniversity.nl%3Apublications%2Fbf8999e5-5813-4de8-a4a0-755dc680dbd7
https://doi.org/10.1007/978-3-030-35802-0_5
https://ui.adsabs.harvard.edu/abs/2018arXiv181204263C/abstract
https://arxiv.org/abs/1812.04263

Secure total domination in chain graphs and cographs

Autoren: Anupriya Jha

Quelle: AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 826-832 (2020)

Schlagwörter: linear time algorithm, secure total domination, QA1-939, 0211 other engineering and technologies, total domination, cographs, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, chain graphs, Mathematics

Zugangs-URL: https://www.tandfonline.com/doi/pdf/10.1016/j.akcej.2019.10.005?needAccess=true
https://doaj.org/article/adb5521292dc4880b411a1086d2d6de6
https://www.tandfonline.com/doi/full/10.1016/j.akcej.2019.10.005

SINr: Fast Computing of Sparse Interpretable Node Representations is not a Sin!

Autoren: Prouteau, Thibault Connes, Victor Dugué, Nicolas et al.

Weitere Verfasser: Prouteau, Thibault Connes, Victor Dugué, Nicolas et al.

Quelle: Lecture Notes in Computer Science, ; Advances in Intelligent Data Analysis XIX, 19th International Symposium on Intelligent Data Analysis, IDA 2021 ; https://hal.science/hal-03197434 ; Advances in Intelligent Data Analysis XIX, 19th International Symposium on Intelligent Data Analysis, IDA 2021, Apr 2021, Porto, Portugal. pp.325-337, ⟨10.1007/978-3-030-74251-5_26⟩

Schlagwörter: Link prediction, Network science, Linear-time algorithm, Word embedding, Community detection, Graph embedding, [INFO.INFO-SI]Computer Science [cs]/Social and Information Networks [cs.SI], [INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG], [INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI], [INFO.INFO-CL]Computer Science [cs]/Computation and Language [cs.CL]

Geographisches Schlagwort: Porto, Portugal

Time: Porto, Portugal

Verfügbarkeit: https://hal.science/hal-03197434
https://hal.science/hal-03197434v1/document
https://hal.science/hal-03197434v1/file/SINr_fast_computing_of_Sparse_Interpretable_Node_Representations_is_not_a_sin.pdf
https://doi.org/10.1007/978-3-030-74251-5_26

On total f-domination: Polyhedral and algorithmic results

Autoren: M. Dell'Amico NETO, JOSE'

Quelle: Discrete Applied Mathematics. 258:97-104

Schlagwörter: Linear-time algorithm, Polytope, Total domination, Tree, 0102 computer and information sciences, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: https://www.sciencedirect.com/science/article/am/pii/S0166218X18306309
https://hal.archives-ouvertes.fr/hal-01975659
https://iris.unimore.it/handle/11380/1181228
https://www.sciencedirect.com/science/article/abs/pii/S0166218X18306309
https://dblp.uni-trier.de/db/journals/dam/dam258.html#DellAmicoN19

Total 2-Rainbow Domination in Graphs

Autoren: Huiqin Jiang Yongsheng Rao

Quelle: Mathematics, Vol 10, Iss 2059, p 2059 (2022)

Schlagwörter: total 2-rainbow domination, total 2-rainbow domination number, NP-complete, linear-time algorithm, Mathematics, QA1-939

Relation: https://www.mdpi.com/2227-7390/10/12/2059; https://doaj.org/toc/2227-7390; https://doaj.org/article/3246653cc97b455fa6dc90c1bbc47ee1

Verfügbarkeit: https://doi.org/10.3390/math10122059
https://doaj.org/article/3246653cc97b455fa6dc90c1bbc47ee1

Approximating Small Balanced Vertex Separators in Almost Linear Time

Autoren: Brandt, Sebastian Wattenhofer, Roger

Quelle: Lecture Notes in Computer Science ISBN: 9783319621265
Algorithmica, 81 (10)

Schlagwörter: Parallel processing, Linear-time algorithm, 0102 computer and information sciences, 0101 mathematics, Balanced vertex separator, 01 natural sciences

Dateibeschreibung: application/application/pdf

Zugangs-URL: https://dblp.uni-trier.de/db/conf/wads/wads2017.html#BrandtW17
https://rd.springer.com/chapter/10.1007/978-3-319-62127-2_20
https://link.springer.com/chapter/10.1007/978-3-319-62127-2_20
https://www.research-collection.ethz.ch/handle/20.500.11850/353274
https://doi.org/10.1007/s00453-018-0490-x
https://dblp.uni-trier.de/db/journals/algorithmica/algorithmica81.html#BrandtW19
https://link.springer.com/article/10.1007%2Fs00453-018-0490-x
http://hdl.handle.net/20.500.11850/353274

Medians in Median Graphs and Their Cube Complexes in Linear Time

Autoren: Bénéteau, Laurine Chalopin, Jérémie Chepoi, Victor et al.

Weitere Verfasser: Bénéteau, Laurine Chalopin, Jérémie Chepoi, Victor et al.

Schlagwörter: Median Graph, CAT(0) Cube Complex, Median Problem, Linear Time Algorithm, LexBFS

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 168, 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.10

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.ICALP.2020.10
https://nbn-resolving.org/urn:nbn:de:0030-drops-124171
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2020.10

On f-domination: polyhedral and algorithmic results

Autoren: Dell'Amico M. Neto J.

Quelle: Mathematical Methods of Operations Research. 90:1-22

Schlagwörter: Domination, Linear-time algorithm, Polyhedral combinatorics, Tree, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences

Dateibeschreibung: application/pdf

Zugangs-URL: https://dblp.uni-trier.de/db/journals/mmor/mmor90.html#DellAmicoN19
https://ideas.repec.org/a/spr/mathme/v90y2019i1d10.1007_s00186-018-0650-4.html
https://doi.org/10.1007/s00186-018-0650-4
https://link.springer.com/article/10.1007/s00186-018-0650-4
https://link.springer.com/content/pdf/10.1007%2Fs00186-018-0650-4.pdf
https://iris.unimore.it/handle/11380/1215194

A linear time algorithm for minimum equitable dominating set in trees

Autoren: Rana, Sohel Nayeem, Sk. Md. Abu NAYEEM, SK MD ABU

Quelle: Proyecciones (Antofagasta, On line); Vol. 40 No. 4 (2021); 805-814 ; Proyecciones. Revista de Matemática; Vol. 40 Núm. 4 (2021); 805-814 ; 0717-6279 ; 10.22199/issn.0717-6279-2021-04

Schlagwörter: Equitable domination, Linear time algorithm, Trees, 05C05, 05C69, 05C85

Dateibeschreibung: application/pdf

Relation: https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4552/3830; https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4552

Verfügbarkeit: https://www.revistaproyecciones.cl/index.php/proyecciones/article/view/4552
https://doi.org/10.22199/issn.0717-6279-4552