Suchergebnisse - "FPT-algorithm"

Fair division with minimal withheld information in social networks von Bliznets, Ivan, Bukov, Anton, Sagunov, Danil

“… We present a study of a few graph-based problems motivated by fair allocation of resources in a social network. The central role in the paper is played by the …”
Volltext

A new width parameter of graphs based on edge cuts: α-edge-crossing width von Chang, Yeonsu, Kwon, O-joung, Lee, Myounghwan

“… We introduce graph width parameters, called α-edge-crossing width and edge-crossing width. These are defined in terms of the number of edges crossing a bag of …”
Volltext

Multi-parameter analysis of finding minors and induced subgraphs in edge-periodic temporal graphs von Arrighi, Emmanuel, Grüttemeier, Niels, Morawietz, Nils, Sommer, Frank, Wolf, Petra

“… We study the computational complexity of determining structural properties of edge-periodic temporal graphs (EPGs). EPGs are time-varying graphs that compactly …”
Volltext

Exact and approximation algorithms for covering timeline in temporal graphs von Dondi, Riccardo, Popa, Alexandru

“… We consider a variant of vertex cover on temporal graphs that has been recently defined for summarization of timeline activities in temporal graphs. The …”
Volltext

On the complexity of singly connected vertex deletion von Das, Avinandan, Kanesh, Lawqueen, Madathil, Jayakrishnan, Muluk, Komal, Purohit, Nidhi, Saurabh, Saket

“… A digraph D is singly connected if for all ordered pairs of vertices u,v∈V(D), there is at most one path in D from u to v. In this paper, we study the Singly …”
Volltext

Structural Parameterization of Cluster Deletion von Italiano, Giuseppe F., Konstantinidis, Athanasios L., Papadopoulos, Charis

“… In the Weighted Cluster Deletion problem we are given a graph with non-negative integral edge weights and the task is to determine, for a target value k , if …”
Volltext

Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization von Gomes, Guilherme C. M., Sau, Ignasi

“… A matching cut is a partition of the vertex set of a graph into two sets A and B such that each vertex has at most one neighbor in the other side of the cut …”
Volltext

Parameterized complexity of the MINCCA problem on graphs of bounded decomposability von Gözüpek, Didem, Özkan, Sibel, Paul, Christophe, Sau, Ignasi, Shalom, Mordechai

“… In an edge-colored graph, the cost incurred at a vertex on a path when two incident edges with different colors are traversed is called reload or changeover …”
Volltext

Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization von Gomes, Guilherme C. M., Guedes, Matheus R., dos Santos, Vinicius F.

“… An n -vertex graph is equitably k -colorable if there is a proper coloring of its vertices such that each color is used either n / k or n / k times. While …”
Volltext

Parameterized Complexity of Conflict-Free Matchings and Paths von Agrawal, Akanksha, Jain, Pallavi, Kanesh, Lawqueen, Saurabh, Saket

“… An input to a conflict-free variant of a classical problem Γ , called Conflict-Free Γ , consists of an instance I of Γ coupled with a graph H , called the …”
Volltext

A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs von Thomassé, Stéphan, Trotignon, Nicolas, Vušković, Kristina

“… The maximum stable set problem is NP-hard, even when restricted to triangle-free graphs. In particular, one cannot expect a polynomial time algorithm deciding …”
Volltext

Constrained Multilinear Detection and Generalized Graph Motifs von Björklund, Andreas, Kaski, Petteri, Kowalik, Łukasz

“… We introduce a new algebraic sieving technique to detect constrained multilinear monomials in multivariate polynomial generating functions given by an …”
Volltext

Boolean-width of graphs von Bui-Xuan, Binh-Minh, Telle, Jan Arne, Vatshelle, Martin

“… We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods–Boolean sums of neighborhoods–across a cut of a …”
Volltext

Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem von Kawarabayashi, Ken-ichi, Kobayashi, Yusuke

“… We investigate generalizations of the following well-known problems in the framework of parameterized complexity: the feedback set problem and the cycle …”
Volltext

On the complexity of computing the k-restricted edge-connectivity of a graph von Montejano, Luis Pedro, Sau, Ignasi

“… The k-restricted edge-connectivity of a graph G, denoted by λk(G), is defined as the minimum size of an edge set whose removal leaves exactly two connected …”
Volltext

Obtaining a Planar Graph by Vertex Deletion von Marx, Dániel, Schlotter, Ildikó

“… In the  k - Apex problem the task is to find at most  k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form …”
Volltext

MSOL restricted contractibility to planar graphs von Abello, James, Klavík, Pavel, Kratochvíl, Jan, Vyskočil, Tomáš

“… We study the computational complexity of graph planarization via edge contraction. The problem Contract asks whether there exists a set S of at most k edges …”
Volltext

Exact and approximate algorithms for clustering problem in wireless sensor networks von Yarinezhad, Ramin, Hashemi, Seyed Naser

“… Clustering is an effective method for improving the network lifetime and the overall scalability of a wireless sensor network. The problem of balancing the …”
Volltext

A Sub-exponential FPT Algorithm and a Polynomial Kernel for Minimum Directed Bisection on Semicomplete Digraphs von Madathil, Jayakrishnan, Sharma, Roohani, Zehavi, Meirav

“… Given an n -vertex digraph D and a non-negative integer k , the M inimum D irected B isection problem asks if the vertices of D can be partitioned into two …”
Volltext

Obtaining split graphs by edge contraction von Guo, Chengwei, Cai, Leizhen

“… We study the parameterized complexity of the following Split Contraction problem: Given a graph G, and an integer k as parameter, determine whether G can be …”
Volltext