Suchergebnisse - "polynomial algorithm"

Dyadic linear programming and extensions

Autoren: Abdi, Ahmad Cornuéjols, Gérard Guenin, Bertrand et al.

Quelle: Mathematical Programming. 213:473-516

Schlagwörter: floating-point arithmetic, Optimization and Control (math.OC), dyadic rational, FOS: Mathematics, 90C05, 90C10, 90C27, linear programming, polynomial algorithm, dense abelian subgroup, integer programming, Mathematics - Optimization and Control

Zugangs-URL: http://arxiv.org/abs/2309.04601
http://eprints.lse.ac.uk/125702/

Equitable colorings of ��-corona products of cubic graphs

Autoren: Hanna Furmańczyk Marek Kubale

Quelle: Archives of Control Sciences, Vol vol. 34, Iss No 1, Pp 211-223 (2024)

Schlagwörter: 1-absolute approximation algorithm, FOS: Computer and information sciences, 𝑙-corona products, Discrete Mathematics (cs.DM), cubic graph, equitable chromatic number, polynomial algorithm, Information technology, 0102 computer and information sciences, T58.5-58.64, 01 natural sciences, QA1-939, corona graph, Mathematics, Computer Science - Discrete Mathematics

Zugangs-URL: http://arxiv.org/abs/1704.05929

Safe sets and in-dominating sets in digraphs

Autoren: Bai, Yandong Bang-Jensen, Jørgen Fujita, Shinya et al.

Quelle: Discrete Applied Mathematics. 346:215-227

Schlagwörter: Safe set, Polynomial algorithm, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Tournament, 01 natural sciences, In-dominating set, NP-complete

Zugangs-URL: https://portal.findresearcher.sdu.dk/da/publications/6543d974-85e7-438e-8d86-8cd52d644e91
https://doi.org/10.1016/j.dam.2023.12.012

Algorithms for Competitive Division of Chores

Autoren: Simina Brânzei Fedor Sandomirskiy

Quelle: Mathematics of Operations Research. 49:398-429

Schlagwörter: FOS: Computer and information sciences, General Mathematics, Pareto frontier, 0102 computer and information sciences, chores, Management Science and Operations Research, 01 natural sciences, fair division, FOS: Economics and business, Computer Science - Computer Science and Game Theory, Computer Science - Data Structures and Algorithms, 0502 economics and business, bads, Economics - Theoretical Economics, Data Structures and Algorithms (cs.DS), market equilibrium, consumption graph, 05 social sciences, 1. No poverty, polynomial algorithm, Computer Science Applications, Theoretical Economics (econ.TH), competitive rule, Computer Science and Game Theory (cs.GT)

Zugangs-URL: http://arxiv.org/abs/1907.01766

Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs

Autoren: J. Bang‐Jensen Y. Wang

Quelle: Journal of Graph Theory. 106:182-197

Schlagwörter: arc-disjoint subdigraphs, in-branchings, FOS: Mathematics, Mathematics - Combinatorics, out-branchings, polynomial algorithm, 0102 computer and information sciences, Combinatorics (math.CO), 05C20, 05C38, 05C40, 05C85, semicomplete digraph, 01 natural sciences

Zugangs-URL: http://arxiv.org/abs/2302.06177
https://portal.findresearcher.sdu.dk/da/publications/7fbe65f8-eca3-4886-996b-a1f3f9c652ea
https://doi.org/10.1002/jgt.23072

(1,1)-Cluster Editing is polynomial-time solvable

Autoren: Gregory Gutin Anders Yeo

Quelle: Discrete Applied Mathematics. 340:259-271

Schlagwörter: FOS: Computer and information sciences, Computer Science - Machine Learning, Discrete Mathematics (cs.DM), Cluster editing, Polynomial algorithm, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, Machine Learning (cs.LG), Computer Science - Data Structures and Algorithms, FOS: Mathematics, Mathematics - Combinatorics, Data Structures and Algorithms (cs.DS), Combinatorics (math.CO), Computer Science - Discrete Mathematics

Zugangs-URL: http://arxiv.org/abs/2210.07722
https://portal.findresearcher.sdu.dk/da/publications/89d85c38-c1bf-4c08-8502-7c4ac6b06002
https://doi.org/10.1016/j.dam.2023.07.002

Real‐time estimation of olive flounder growth in indoor aquaculture using cameras combined with a grid

Autoren: Hang Thi Phuong Nguyen Myoungjae Jun Hieyong Jeong

Quelle: Journal of the World Aquaculture Society, Vol 56, Iss 1, Pp n/a-n/a (2025)

Schlagwörter: camera, image processing, interpolating polynomial algorithm, LED grid, length‐weight relationship, sensor fusion, Aquaculture. Fisheries. Angling, SH1-691

Dateibeschreibung: electronic resource

Relation: https://doaj.org/toc/0893-8849; https://doaj.org/toc/1749-7345

Zugangs-URL: https://doaj.org/article/541061dd25ba4db9a38b3392aa6cd0cd

On the -forcing number: computational approach and exact values

Autoren: Aida Abiad Maryam Moghaddas

Quelle: Journal of Physics: Complexity, Vol 6, Iss 4, p 045005 (2025)

Schlagwörter: zero forcing, variants of zero forcing, block graphs, polynomial algorithm, Science, Physics, QC1-999

Relation: https://doi.org/10.1088/2632-072X/ae1430; https://doaj.org/toc/2632-072X; https://doaj.org/article/e6d7baa2ebbc40638e1f94f382a2c292

Verfügbarkeit: https://doi.org/10.1088/2632-072X/ae1430
https://doaj.org/article/e6d7baa2ebbc40638e1f94f382a2c292

Aspects of the commuting graph

Autoren: Arvind, V. Cameron, Peter J. Ma, Xuanlong et al.

Quelle: Arvind , V , Cameron , P J , Ma , X & Maslova , N 2025 , ' Aspects of the commuting graph ' , Journal of Algebra . https://doi.org/10.1016/j.jalgebra.2025.07.020

Schlagwörter: Commuting graph, Finite group, Quasi-polynomial algorithm

Verfügbarkeit: https://research-portal.st-andrews.ac.uk/en/publications/601434b9-30eb-4211-a727-6ac7c40e0465
https://doi.org/10.1016/j.jalgebra.2025.07.020
https://arxiv.org/abs/2305.07301

Alternative definition of the strong NP-completeness ; Альтернативное определение NP-полноты в сильном смысле

Autoren: Ya. M. Shafransky Я. М. Шафранский

Quelle: Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series; Том 60, № 4 (2024); 303-308 ; Известия Национальной академии наук Беларуси. Серия физико-математических наук; Том 60, № 4 (2024); 303-308 ; 2524-2415 ; 1561-2430 ; 10.29235/1561-2430-2024-60-4

Schlagwörter: NP-полнота в сильном смысле, pseudo-polynomial algorithm, class NP, NP-completeness, strong NP-completeness, псевдополиномиальный алгоритм, класс NP, NP-полнота

Dateibeschreibung: application/pdf

Relation: https://vestifm.belnauka.by/jour/article/view/810/618; Garey, M. R. “Strong” NP-completeness results: motivation, examples, and implications / M. R. Garey, D. S. Johnson // J. Ass. Comput. Machinery. – 1978. – Vol. 25, № 3. – P. 499–508. https://doi.org/10.1145/322077.322090; Garey, M. R. Computers and Intractability. A Guide to the Theory of NP-completeness / M. R. Garey, D. S. Johnson. – New York: W. H. Freeman and Company, 1979. – 348 p.; Webster, S. Note on “Parallel Machine Scheduling with Batch Setup Times” / S. Webster // Oper. Res. – 1998. – Vol. 46, № 3. – P. 423. https://doi.org/10.1287/opre.46.3.423; Shafransky, Y. M. On some contradictions in theory of computational complexity / Y. M. Shafransky // Third Workshop on Models and Algorithms for Planning and Scheduling. – Cambridge, 1997. – P. 42.; https://vestifm.belnauka.by/jour/article/view/810

Verfügbarkeit: https://vestifm.belnauka.by/jour/article/view/810
https://doi.org/10.29235/1561-2430-2024-60-4-303-308

The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph

Autoren: Alexander Valeryevich Smirnov

Quelle: Моделирование и анализ информационных систем, Vol 30, Iss 1, Pp 6-15 (2023)

Schlagwörter: shortest path, multiple graph, 0211 other engineering and technologies, reachability set, polynomial algorithm, Information technology, 02 engineering and technology, 0101 mathematics, T58.5-58.64, 01 natural sciences, multiple path

Zugangs-URL: https://doaj.org/article/56ebb6a1c1834b0fb64422aabbb7056b

Prototype Mobile Vision System for Automatic Length Estimation of Olive Flounder (Paralichthys olivaceus) in Indoor Aquaculture

Autoren: Inyeong Kwon Hang Thi Phuong Nguyen Paththige Waruni Prasadini Fernando et al.

Quelle: Journal of Marine Science and Engineering, Vol 13, Iss 6, p 1167 (2025)

Schlagwörter: olive flounder, length estimation, image processing, Lagrange’s interpolating polynomial algorithm, length–weight relationship, Naval architecture. Shipbuilding. Marine engineering, VM1-989, Oceanography, GC1-1581

Dateibeschreibung: electronic resource

Relation: https://www.mdpi.com/2077-1312/13/6/1167; https://doaj.org/toc/2077-1312

Zugangs-URL: https://doaj.org/article/1184bb9849ea4032b4021b3a0b08d2dc

A Strongly-Polynomial Algorithm for General Linear Programming via Epochic Combinatorial Pivoting and Universal Shock Control ; Un algorithme fortement polynomial pour la programmation linéaire générale via pivot combinatoire par époques et contrôle universel de choc

Autoren: Vitali, Jerome

Schlagwörter: Linear Programming, Strongly-Polynomial Algorithm, Combinatorial Pivoting, Universal Shock Lemma, Epoch Law, Bit-Agnostic Optimization, Lexicographic Perturbation, Polynomial Pivot Bound, Hadamard Inequality, Deterministic Optimization, PN Algorithm

Relation: https://zenodo.org/communities/mathematics_numbers_theory/; https://zenodo.org/records/16932508; oai:zenodo.org:16932508; https://doi.org/10.5281/zenodo.16932508

Verfügbarkeit: https://doi.org/10.5281/zenodo.16932508
https://zenodo.org/records/16932508

Polynomial-Computable Representation of Neural Networks in Semantic Programming

Autoren: Sergey Goncharov Andrey Nechesov

Quelle: J, Vol 6, Iss 1, Pp 48-57 (2023)
Volume 6
Issue 1
Pages: 48-57

Schlagwörter: polynomiality, machine learning, semantic programming, AI, Science, logical programming language, polynomial algorithm, neural networks

Dateibeschreibung: application/pdf

Zugangs-URL: https://doaj.org/article/a1a34c2bf92f4ef9b4d228bc0af62f25

Complexity and algorithms for constant diameter augmentation problems

Autoren: Kim, Eun Jung Milanic, Martin Monnot, Jérôme et al.

Weitere Verfasser: Kim, Eun Jung Milanic, Martin Monnot, Jérôme et al.

Quelle: Theoretical Computer Science. 904:15-26

Schlagwörter: Graph diameter, Polynomial algorithm, 0211 other engineering and technologies, premer grafa, [MATH] Mathematics [math], 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], 01 natural sciences, NP-complete problem, FOS: Mathematics, Mathematics - Combinatorics, NP-poln problem, NP-complete, Blocker problem, graph diameter, polynomial algorithm, blocker problem, polinomski algoritem, Modèles mathématiques. Algorithmes, problem blokiranja, Combinatorics (math.CO)

Dateibeschreibung: text/url; application/pdf

Zugangs-URL: http://arxiv.org/pdf/2010.00273
http://arxiv.org/abs/2010.00273
https://hal.archives-ouvertes.fr/hal-02958747
https://www.sciencedirect.com/science/article/abs/pii/S0304397521003042
https://repozitorij.upr.si/izpisgradiva.php?id=16313&lang=eng
https://repozitorij.upr.si/IzpisGradiva.php?id=16313
https://doi.org/10.1016/j.tcs.2021.05.020
https://hdl.handle.net/20.500.12556/RUP-16313
https://hal.science/hal-03107522v1
https://doi.org/10.1016/j.tcs.2021.05.020

The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph

Autoren: A. V. Smirnov

Quelle: Моделирование и анализ информационных систем, Vol 29, Iss 4, Pp 372-387 (2022)

Schlagwörter: shortest path, multiple graph, 0211 other engineering and technologies, reachability set, polynomial algorithm, Information technology, 0102 computer and information sciences, 02 engineering and technology, T58.5-58.64, 01 natural sciences, multiple path, divisible graph

Zugangs-URL: https://doaj.org/article/2a9cfcfb43004102810866d489943e9f

Minimal size balanced sets mod p

Autoren: Nguyen Phu Cuong Zhivko P. Nedev Adamu Murtala Zungeru

Quelle: Scientific African, Vol 25, Iss , Pp e02252- (2024)

Schlagwörter: Minimal size, Balanced sets, Mod p, Polynomial algorithm, Lucky primes, Balanced set modulo, Science

Dateibeschreibung: electronic resource

Relation: http://www.sciencedirect.com/science/article/pii/S2468227624001984; https://doaj.org/toc/2468-2276

Zugangs-URL: https://doaj.org/article/f78fb0e354fd424fa7028ed4c139e875

A Strongly-Polynomial Algorithm for General Linear Programming via Epochic Combinatorial Pivoting and Universal Shock Control

Autoren: Vitali, Jerome

Schlagwörter: Hadamard Inequality, Polynomial Pivot Bound, PN Algorithm, Lexicographic Perturbation, Universal Shock Lemma, Epoch Law, Linear Programming, Combinatorial Pivoting, Strongly-Polynomial Algorithm, Bit-Agnostic Optimization, Deterministic Optimization

Finding a Maximum Restricted t-Matching via Boolean Edge-CSP

Autoren: Iwamasa, Yuni Kobayashi, Yusuke Takazawa, Kenjiro et al.

Weitere Verfasser: Iwamasa, Yuni Kobayashi, Yusuke Takazawa, Kenjiro et al.

Schlagwörter: Polynomial algorithm, C_k-free 2-matching, Jump system, Boolean edge-CSP

Dateibeschreibung: application/pdf

Relation: Is Part Of LIPIcs, Volume 308, 32nd Annual European Symposium on Algorithms (ESA 2024); https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.75

Verfügbarkeit: https://doi.org/10.4230/LIPIcs.ESA.2024.75
https://nbn-resolving.org/urn:nbn:de:0030-drops-211463
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2024.75

Spanning eulerian subdigraphs in semicomplete digraphs

Autoren: Bang-Jensen, Jørgen Havet, Frédéric Yeo, Anders et al.

Weitere Verfasser: Bang-Jensen, Jørgen Havet, Frédéric Yeo, Anders et al.

Quelle: Journal of Graph Theory. 102:578-606

Schlagwörter: Semicomplete digraph, FOS: Computer and information sciences, Discrete Mathematics (cs.DM), polynomial algorithm, 0102 computer and information sciences, semicomplete digraph, 01 natural sciences, tournament, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Eulerian subdigraph, FOS: Mathematics, Mathematics - Combinatorics, arc-connectivity, Combinatorics (math.CO), Tournament, eulerian subdigraph, Arc-connectivity, Computer Science - Discrete Mathematics

Dateibeschreibung: application/pdf

Zugangs-URL: http://arxiv.org/abs/1905.11019
https://inria.hal.science/hal-03844943v1/document
https://inria.hal.science/hal-03844943v1
https://doi.org/10.1002/jgt.22779
https://portal.findresearcher.sdu.dk/da/publications/3238d41c-8cca-46f3-aa66-c5379237cdbd
https://doi.org/10.1002/jgt.22888