• Search: "polynomial algorithm"

Showing 141 - 160 of 2,044

141

Polynomial Algorithms for Isotonic Regression
Lecture Notes-Monograph Series, 1997 Jan 01. 31, 147-160.

Academic journal
Save to List
142

On the complexity of the exact weighted independent set problem
Milanic, Martin ; Monnot, Jérôme ; Rutgers Center for Operations Research (RUTCOR) ; et al.

exact weighted independe... NP-complete pseudo-polynomial algori... modular decomposition. modular decomposition [INFO.INFO-CC]Computer S... …
Electronic Resource
Save to List
143

Spanning eulerian subdigraphs in semicomplete digraphs
Havet, Frédéric ; Bang-Jensen, Jørgen ; Yeo, Anders ; et al.
https://inria.hal.science/hal-03472923 ; [Research Report] Inria; CNRS; I3S; Université côte d'azur. 2021.

polynomial algorithm Semicomplete digraph Tournament Eulerian subdigraph Arc-connectivity [INFO.INFO-DM]Computer S...
Report
Save to List
144

Rounding of Polytopes in the Real Number Model of Computation
Khachiyan, Leonid G.
Mathematics of Operations Research, 1996 May 01. 21(2), 307-320.

Academic journal
Save to List
145

Popular Matchings with Two-Sided Preferences and One-Sided Ties
Cseh, Ágnes ; Huang, Chien-Chung ; Kavitha, Telikepalli
Lecture Notes in Computer Science ISBN: 9783662476710

FOS: Computer and inform... Discrete Mathematics (cs... ddc:330 ties 0211 other engineering a... polynomial algorithm …
Book
Save to List
146

Decomposition of graphs: some polynomial cases
Bazgan, Cristina ; Tuza, Zsolt ; Vanderpooten, Daniel ; et al.

Graph decomposition degree constraints treewidth girth complexity …
Electronic Resource
Save to List
147

Complexity of the satisfactory partition problem
Bazgan, Cristina ; Tuza, Zsolt ; Vanderpooten, Daniel ; et al.

Satisfactory partition graph complexity polynomial algorithm NP-complete [INFO.INFO-CC]Computer S... …
Electronic Resource
Save to List
148

Blocking unions of arborescences
Bernáth, Attila ; Pap, Gyula
In Discrete Optimization November 2016 22 Part B:277-290

Academic journal
Save to List
149

The complexity of finding arc-disjoint branching flows
Bang-Jensen, J. ; Havet, Frédéric ; Yeo, Anders
In Discrete Applied Mathematics 20 August 2016 209:16-26

Academic journal
Save to List
150

A characterisation of the generic rigidity of 2-dimensional point–line frameworks
Jackson, Bill ; Owen, J.C.
In Journal of Combinatorial Theory, Series B July 2016 119:96-121

Academic journal
Save to List
151

A polynomial algorithm of edge-neighbor-scattering number of trees
Liu, Yong ; Wei, Zongtian ; Shi, Jiarong ; et al.
In Applied Mathematics and Computation 20 June 2016 283:1-5

Academic journal
Save to List
152

Dual-mode production planning for manufacturing with emission constraints
Hong, Zhaofu ; Chu, Chengbin ; Yu, Yugang
In European Journal of Operational Research 16 May 2016 251(1):96-106

Academic journal
Save to List
153

Enumerating minimal dominating sets in chordal bipartite graphs
Golovach, Petr A. ; Heggernes, Pinar ; Kanté, Mamadou M. ; et al.
In Discrete Applied Mathematics 30 January 2016 199:30-36

Academic journal
Save to List
154

This result is not available to guest users.

155

Safe sets and in-dominating sets in digraphs
Bai, Yandong ; Bang-Jensen, Jørgen ; Fujita, Shinya ; et al.
Bai, Y, Bang-Jensen, J, Fujita, S, Ono, H & Yeo, A 2024, 'Safe sets and in-dominating sets in digraphs', Discrete Applied Mathematics, vol. 346, pp. 215-227. https://doi.org/10.1016/j.dam.2023.12.012

In-dominating set NP-complete Polynomial algorithm Safe set Tournament
Academic journal
Save to List
156

Disjoint Paths in Decomposable Digraphs
Bang-Jensen, Jørgen ; Christiansen, Tilde My ; Maddaloni, Alessandro
Bang-Jensen, J, Christiansen, T M & Maddaloni, A 2017, ' Disjoint paths in decomposable digraphs ', Journal of Graph Theory, vol. 85, no. 2, pp. 545-567 . https://doi.org/10.1002/jgt.22090

disjoint paths k-linkage problem quasi-transitive digraph polynomial algorithm 0102 computer and inform... (round-)decomposable dig... …
Academic journal
Save to List
157

Equitable coloring of corona products of cubic graphs is harder than ordinary coloring
Kubale, Marek
ARS Mathematica Contemporanea. 10(2):333-347

equitable graph coloring cubic graph NP-hardness corona graph equitable chromatic numb... polynomial algorithm
Academic journal
Save to List
158

Global Minimum Depth in Edwards-Anderson Model
Iakov Karandashev ; Boris Kryzhanovsky
Communications in Computer and Information Science ISBN: 9783030202569

Global minimum Statistical Mechanics (c... FOS: Physical sciences 02 engineering and techn... Disordered Systems and N... Condensed Matter - Disor... …
Book
Save to List
159

Equitable Colorings Of Corona Multiproducts Of Graphs
Furmánczyk Hanna ; Kubale Marek ; Mkrtchyan Vahan V.
Discussiones Mathematicae Graph Theory, Vol 37, Iss 4, Pp 1079-1094 (2017)

corona graph equitable chromatic numb... equitable coloring conje... equitable graph coloring multiproduct of graphs np-completeness …
Academic journal
Save to List
160

A reduction algorithm for the weighted stable set problem in claw-free graphs
NOBILI, Paolo ; A. Sassano
Discrete Applied Mathematics. 165:245-262

Claw-free graphs Clique reduction Matching Stable set Discrete Mathematics and... Stable Set …
Academic journal
Save to List
Search Tools: Get RSS Feed Email this Search Save Search

Filter