Výsledky vyhledávání - "Polynomial-time algorithms"

Büyük ölçekli ağlar için polinom zamanlı kritik düğüm tespiti algoritması Autor Uğurlu, Onur, Aygül, Yeşim

“…Ağlar, karmaşık sistemlerin modellenmesinde ve analiz edilmesinde kritik bir rol oynar; bu nedenle ağ analizleri hem sosyal hem de teknolojik sistemlerde…”
Získat plný text

Minimal Control Nodes for Strong Structural Observability of Discrete-Time Iterative Systems: Explicit Formulas and Polynomial-Time Algorithms Autor Zhu, Shiyong, Lu, Jianquan, Ho, Daniel W.C., Cao, Jinde

“…In this article, we initiate an important class of vertex-marked directed graphs, referred to as the strong structurally observable graphs (SSOGs), to be the…”
Získat plný text

Critical (P5,dart)-free graphs Autor Xia, Wen, Jooken, Jorik, Goedgebeur, Jan, Huang, Shenwei

“…Given two graphs H1 and H2, a graph is (H1,H2)-free if it contains no induced subgraph isomorphic to H1 nor H2. A dart is the graph obtained from a diamond by…”
Získat plný text

Colouring graphs with no induced six-vertex path or diamond Autor Goedgebeur, Jan, Huang, Shenwei, Ju, Yiao, Merkel, Owen

“…The diamond is the graph obtained by removing an edge from the complete graph on 4 vertices. A graph is (P6, diamond)-free if it contains no induced subgraph…”
Získat plný text

Polynomial-time algorithms for multimarginal optimal transport problems with structure Autor Altschuler, Jason M., Boix-Adserà, Enric

“…Multimarginal Optimal Transport (MOT) has attracted significant interest due to applications in machine learning, statistics, and the sciences. However, in…”
Získat plný text

Acyclic matching in some subclasses of graphs Autor Panda, B.S., Chaudhary, Juhi

“…A subset M⊆E of edges of a graph G=(V,E) is called a matching if no two edges of M share a common vertex. Given a matching M in G, a vertex v∈V is called…”
Získat plný text

Scheduling with jobs at fixed positions Autor Jaehn, Florian

“…In this paper, we study classical single machine scheduling problems with the additional constraint that a set of special jobs must be scheduled at certain…”
Získat plný text

Critical (P5, bull)-free graphs Autor Huang, Shenwei, Li, Jiawei, Xia, Wen

“…Given two graphs H1 and H2, a graph is (H1,H2)-free if it contains no induced subgraph isomorphic to H1 or H2. Let Pt be the path on t vertices. A bull is the…”
Získat plný text

Maximum-width rainbow-bisecting empty annulus Autor Bae, Sang Won, Banerjee, Sandip, Baral, Arpita, Mahapatra, Priya Ranjan Sinha, Yoon, Sang Duk

“…Given a set of n colored points with k colors in the plane, we study the problem of computing a maximum-width rainbow-bisecting empty annulus (of objects…”
Získat plný text

IoTAthena: Unveiling IoT Device Activities From Network Traffic Autor Wan, Yinxin, Xu, Kuai, Wang, Feng, Xue, Guoliang

“…The recent spate of cyber attacks towards Internet of Things (IoT) devices in smart homes calls for effective techniques to understand, characterize, and…”
Získat plný text

On the geometric red-blue set cover problem Autor Madireddy, Raghunath Reddy, Nandy, Subhas C., Pandit, Supantha

“…Using various geometric objects, we study variations of the geometric Red-Blue Set Cover (RBSC) problem in R2. Here, given two sets R and B of points, called…”
Získat plný text

Independent sets of maximum weight beyond claw-free graphs and related problems Autor Brandstädt, Andreas, Lozin, Vadim, Mosca, Raffaele

“…The maximum weight independent set problem (WIS), which is known to be generally NP-hard, admits polynomial-time solutions when restricted to graphs in some…”
Získat plný text

Minimal Control Nodes for Strong Structural Observability of Discrete-Time Iteration Systems: Explicit Formulas and Polynomial-Time Algorithms Autor Zhu, Shiyong, Lu, Jianquan, Ho, Daniel W.C., Cao, Jinde

“…In this paper, we initiate an important class of vertex-marked directed graphs, referred to as the strong structurally observable graphs (SSOGs), which are the…”
Získat plný text

List-k-Coloring H-Free Graphs for All k>4 Autor Chudnovsky, Maria, Hajebi, Sepehr, Spirkl, Sophie

“…Given an integer k > 4 and a graph H , we prove that, assuming P ≠ NP, the List- k -Coloring Problem restricted to H -free graphs can be solved in polynomial…”
Získat plný text

Induced star partition of graphs Autor Shalu, M.A., Vijayakumar, S., Sandhya, T.P., Mondal, Joyashree

“…Given a graph G, we call a partition (V1,V2,…,Vk) of its vertex set an induced star partition of G if each set in the partition induces a star. In this paper,…”
Získat plný text

Stable Matching with Uncertain Linear Preferences Autor Aziz, Haris, Biró, Péter, Gaspers, Serge, de Haan, Ronald, Mattei, Nicholas, Rastegari, Baharak

“…We consider the two-sided stable matching setting in which there may be uncertainty about the agents’ preferences due to limited information or communication…”
Získat plný text

New algorithms for minimizing the weighted number of tardy jobs on a single machine Autor Hermelin, Danny, Karhi, Shlomo, Pinedo, Michael, Shabtay, Dvir

“…In this paper we study the classical single machine scheduling problem where the objective is to minimize the weighted number of tardy jobs. Our analysis…”
Získat plný text

Hypergeometric L-functions in average polynomial time, II Autor Costa, Edgar, Kedlaya, Kiran S., Roe, David

“…We describe an algorithm for computing, for all primes p ≤ X , the trace of Frobenius at p of a hypergeometric motive over Q in time quasilinear in X . This…”
Získat plný text

Polynomially solvable personnel rostering problems Autor Smet, Pieter, Brucker, Peter, De Causmaecker, Patrick, Vanden Berghe, Greet

“…•Polynomially solvable cases for personnel rostering are identified.•New minimum cost network flow reformulations of rostering are presented.•Different classes…”
Získat plný text

Reconfiguration of Spanning Trees with Degree Constraints or Diameter Constraints Autor Bousquet, Nicolas, Ito, Takehiro, Kobayashi, Yusuke, Mizuta, Haruka, Ouvrard, Paul, Suzuki, Akira, Wasa, Kunihiro

“…We investigate the complexity of finding a transformation from a given spanning tree in a graph to another given spanning tree in the same graph via a sequence…”
Získat plný text