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

Deciding k-Colorability of P 5-Free Graphs in Polynomial Time Autor Hoàng, Chính T., Kamiński, Marcin, Lozin, Vadim, Sawada, Joe, Shu, Xiao

Získať plný text

Zero Duality Gap in Optimal Power Flow Problem Autor Lavaei, Javad, Low, S. H.

“…The optimal power flow (OPF) problem is nonconvex and generally hard to solve. In this paper, we propose a semidefinite programming (SDP) optimization, which…”
Získať plný text

On the computational complexity of the secure state-reconstruction problem Autor Mao, Yanwen, Mitra, Aritra, Sundaram, Shreyas, Tabuada, Paulo

“…In this paper, we discuss the computational complexity of reconstructing the state of a linear system from sensor measurements that have been corrupted by an…”
Získať plný text

On the thinness of trees Autor Bonomo-Braberman, Flavia, Brandwein, Eric, Gonzalez, Carolina Lucía, Sansone, Agustín

“…The study of structural graph width parameters like tree-width, clique-width and rank-width has been ongoing during the last five decades, and their…”
Získať plný text

Maximizing the weighted number of just‐in‐time jobs in a distributed flow‐shop scheduling system Autor Shabtay, Dvir

“…We study a set of scheduling problems in a distributed flow‐shop scheduling system consisting of several flow‐shop production systems (factories) working in…”
Získať plný text

A network flow approach to a common generalization of Clar and Fries numbers Autor Bérczi-Kovács, Erika, Frank, András

“…Clar number and Fries number are two thoroughly investigated parameters of plane graphs emerging from mathematical chemistry to measure stability of organic…”
Získať plný text

Optimal resilient sensor placement problem for secure state estimation Autor Shinohara, Takumi, Namerikawa, Toru

Získať plný text

Connected coalitions in graphs Autor Alikhani, Saeid, Bakhshesh, Davood, Golmohammadi, Hamidreza, Konstantinova, Elena V.

Získať plný text

Load Balancing User Association in Millimeter Wave MIMO Networks Autor Alizadeh, Alireza, Vu, Mai

“…User association is necessary in dense millimeter wave (mmWave) networks to determine which base station a user connects to in order to balance base station…”
Získať plný text

A polynomial time algorithm for the triangle packing problem on interval graphs Autor Myung, Young-Soo

“…The triangle packing problem (TPP) is to find the maximum number of pairwise vertex disjoint triangles in a given graph. The TPP is NP-complete in a general…”
Získať plný text

An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network Autor Abbaas, Omar, Ventura, Jose A.

“…This study addresses the continuous deviation‐flow refueling station location problem on a general network. Instead of having a finite number of candidate…”
Získať plný text

A polynomial-time algorithm for the secure state estimation problem under sparse sensor attacks via state decomposition technique Autor Lu, An-Yang, Yang, Guang-Hong

“…This paper investigates the secure state estimation problem for cyber-physical systems (CPSs) under sparse sensor attacks. In the existing results, the secure…”
Získať plný text

Burning a graph is hard Autor Bessy, Stéphane, Bonato, Anthony, Janssen, Jeannette, Rautenbach, Dieter, Roshanbin, Elham

“…Graph burning is a model for the spread of social contagion. The burning number is a graph parameter associated with graph burning that measures the speed of…”
Získať plný text

Near optimal colourability on hereditary graph families Autor Ju, Yiao, Huang, Shenwei

“…In this paper, we initiate a systematic study on a new notion called near optimal colourability which is closely related to perfect graphs and the Lovász theta…”
Získať plný text

Defective incidence coloring of graphs Autor Bi, Huimin, Zhang, Xin

“…•Proper incidence coloring of graphs is generalized as defective incidence coloring of graphs.•Fast algorithms for constructing the optimal defective incidence…”
Získať plný text

Solving problems on generalized convex graphs via mim-width Autor Bonomo-Braberman, Flavia, Brettell, Nick, Munaro, Andrea, Paulusma, Daniël

Získať plný text

Algorithms and complexity of strongly stable non-crossing matchings Autor Sachin, Panda, B.S.

Získať plný text

Notes on scheduling non-simultaneously released jobs with restricted processing times on uniform machines Autor Vakhania, Nodari

“…We consider a basic optimization problem where non-simultaneously released jobs are to be scheduled on m uniform machines. The objective is to minimize the…”
Získať plný text

Computing the forcing spectrum of outerplanar graphs in polynomial time Autor Gorsky, Maximilian, Kreßin, Fabian

“…The forcing number of a graph with a perfect matching M is the minimum number of edges in M whose endpoints need to be deleted, such that the remaining graph…”
Získať plný text

A semi-“smart predict then optimize” (semi-SPO) method for efficient ship inspection Autor Yan, Ran, Wang, Shuaian, Fagerholt, Kjetil

“…•Develop a tailored multi-target random forest model for predicting ship deficiencies.•Prove that ship inspection planning is polynomially solvable.•Proposed…”
Získať plný text