Suchergebnisse - Polynomial time solvable algorithm

Fast Parameterized Preprocessing for Polynomial-Time Solvable Graph Problems.

Autoren: Himmel, Anne-Sophie Mertzios, George B. Nichterlein, André et al.

Quelle: Communications of the ACM. Apr2024, Vol. 67 Issue 4, p70-79. 10p.

Schlagwörter: *DATA structures, PARAMETERIZATION, POLYNOMIAL time algorithms, NP-hard problems, COMPUTATIONAL complexity

Computing a 3-Role Assignment is Polynomial-Time Solvable on Complementary Prisms.

Autoren: Castonguay, Diane Dias, Elisângela S. Mesquita, Fernanda N. et al.

Quelle: International Journal of Foundations of Computer Science. Apr2025, p1-24. 24p.

Schlagwörter: POLYNOMIAL time algorithms, BIPARTITE graphs, GRAPH connectivity, GRAPH theory

Flow-augmentation I: Directed graphs.

Autoren: Kim, Eun Jung Kratsch, Stefan Pilipczuk, Marcin et al.

Quelle: Journal of the ACM. Feb2025, Vol. 72 Issue 1, p1-38. 38p.

Schlagwörter: POLYNOMIAL time algorithms, GRAPH algorithms, CUTTING stock problem, INTEGERS, LOGICAL prediction, DIRECTED graphs

Polynomial time solvable algorithm to linearly constrained binary quadratic programming problems with Q being a five-diagonal matrix

Autoren: Shenshen Gu Rui Cui

Quelle: Fifth International Conference on Intelligent Control and Information Processing. :366-372

Schlagwörter: 0211 other engineering and technologies, 02 engineering and technology

Zugangs-URL: https://ieeexplore.ieee.org/abstract/document/7010280
http://ieeexplore.ieee.org/document/7010280/

Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication

Autoren: Bentert, Matthias Heeger, Klaus Koana, Tomohiro

Index Begriffe: Computer Science - Data Structures and Algorithms, text

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

On SAT information content, its polynomial-time solvability and fixed code algorithms

Autoren: Drozdowski, Maciej

Index Begriffe: Computer Science - Computational Complexity, Computer Science - Information Theory, F.2, text

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

A Polynomial Time Solvable Algorithm to Linearly Constrained Binary Quadratic Programming Problems with Q being a Tri-Diagonal Matrix

Autoren: Shenshen Gu

Quelle: INTERNATIONAL JOURNAL ON Advances in Information Sciences and Service Sciences. 3:65-72

Schlagwörter: 0209 industrial biotechnology, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology

Zugangs-URL: http://www.aicit.org/aiss/global/paper_detail.html?jname=AISS&q=208

A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant

Autoren: Hochbaum, Dorit S.

Quelle: Operations Research, 2013 Jan 01. 61(1), 184-198.

Zugangs-URL: http://dx.doi.org/10.1287/opre.1120.1126

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems.

Autoren: Gu, Shenshen Cui, Rui Peng, Jiao

Quelle: Neurocomputing. Jul2016, Vol. 198, p171-179. 9p.

Schlagwörter: *POLYNOMIAL time algorithms, *QUADRATIC programming, *INTEGER programming, *SIGNAL processing, *NP-hard problems

Beyond Quasi-Adjoint Graphs: On Polynomial-Time Solvable Cases of the Hamiltonian Cycle and Path Problems.

Autoren: Kasprzak, Marta¹ (AUTHOR) mkasprzak@cs.put.poznan.pl

Quelle: Informatica. 2024, Vol. 35 Issue 4, p807-816. 10p.

Schlagwörter: *POLYNOMIAL time algorithms, *GRAPH theory, *DNA sequencing, *MODEL theory, *ALGORITHMS, *HAMILTONIAN graph theory

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

Autoren: Gutin, Gregory Yeo, Anders

Quelle: Discrete Applied Mathematics. Dec2023, Vol. 340, p259-271. 13p.

Schlagwörter: *NATURAL numbers, *GRAPH algorithms, *EDITING

Theory, algorithms and applications of linear arrangements of trees: generation, expectation and optimization

Autoren: Alemany Puig, Lluís

Weitere Verfasser: University/Department: Universitat Politècnica de Catalunya. Departament de Ciències de la Computació

Thesis Advisors: Ferrer Cancho, Ramon

Quelle: TDX (Tesis Doctorals en Xarxa)

Schlagwörter: Àrees temàtiques de la UPC::Informàtica

Dateibeschreibung: application/pdf

Zugangs-URL: http://hdl.handle.net/10803/693663
https://dx.doi.org/10.5821/dissertation-2117-424527

Clique Cover on L-EPG representations of graphs.

Autoren: Silva, Kedson Alves Santos, Tanilson Dias dos Souza, Uéverton dos Santos

Quelle: Discrete Applied Mathematics. Jul2025, Vol. 370, p145-156. 12p.

Schlagwörter: *REPRESENTATIONS of graphs, *POLYNOMIAL time algorithms, *GRAPH theory, *COMPUTATIONAL complexity, *INTEGERS

Three results towards approximation of special maximum matchings in graphs.

Autoren: Mkrtchyan, Vahan¹ (AUTHOR) vahan.mkrtchyan@gssi.it

Quelle: Discrete Applied Mathematics. Aug2025, Vol. 371, p127-136. 10p.

Schlagwörter: *POLYNOMIAL time algorithms, *NP-complete problems, *STATISTICAL decision making, *ALGORITHMS, *APPROXIMATION algorithms

A Polynomial Time Solvable Algorithm to Binary Quadratic Programming Problems with Q Being a Seven-Diagonal Matrix and Its Neural Network Implementation

Autoren: Shenshen Gu Jiao Peng Rui Cui

Quelle: Lecture Notes in Computer Science ISBN: 9783319124353

Schlagwörter: 13. Climate action

Zugangs-URL: https://rd.springer.com/chapter/10.1007/978-3-319-12436-0_38
https://link.springer.com/chapter/10.1007/978-3-319-12436-0_38

Orientable burning number of graphs.

Autoren: Courtiel, Julien Dorbec, Paul Gima, Tatsuya et al.

Quelle: Discrete Applied Mathematics. May2025, Vol. 367, p116-128. 13p.

Schlagwörter: *GRAPH algorithms, *POLYNOMIAL time algorithms, *NP-hard problems, *UNDIRECTED graphs, *HARDNESS, *BIPARTITE graphs, *DIRECTED graphs

Diverse fair allocations: Complexity and algorithms.

Autoren: Mittal, Harshil Nanoti, Saraswati Sethia, Aditi

Quelle: Discrete Applied Mathematics. Dec2024, Vol. 359, p343-353. 11p.

Schlagwörter: *POLYNOMIAL time algorithms, *NP-hard problems, *VALUATION, *FAIRNESS, *ALGORITHMS

(1,1)-Cluster Editing is Polynomial-time Solvable

Autoren: Gutin, Gregory Yeo, Anders

Index Begriffe: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics, Computer Science - Machine Learning, Mathematics - Combinatorics, text

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

Minimizing total completion time with machine-dependent priority lists.

Autoren: Ravindran Vijayalakshmi, Vipin Schröder, Marc Tamir, Tami

Quelle: European Journal of Operational Research. Jun2024, Vol. 315 Issue 3, p844-854. 11p.

Schlagwörter: *DYNAMIC programming, *MACHINERY, *SCHEDULING, POLYNOMIAL time algorithms, COMPUTATIONAL complexity

Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws

Autoren: Abrishami, Tara Chudnovsky, Maria Dibek, Cemil et al.

Index Begriffe: Computer Science - Data Structures and Algorithms, Computer Science - Discrete Mathematics, text

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