Suchergebnisse - "branching algorithms"

Faster parameterized algorithm for r-pseudoforest deletion von Tsur, Dekel

“… In the r-Pseudoforest Deletion problem, the input is a graph G and integers k,r, and the goal is to decide whether there is a set of at most k vertices whose …”
Volltext

Faster algorithms and a smaller kernel for Cliques or Trees Vertex Deletion von Tsur, Dekel

“… In the Cliques or Trees Vertex Deletion problem, the input is a graph G and an integer k, and the goal is to decide whether there is a set of at most k …”
Volltext

Cluster deletion revisited von Tsur, Dekel

“… •We study the Cluster Deletion problem and give an O⁎(1.404k)-time algorithm for this problem.•Our result improves the result of Böcker and Damaschke for this …”
Volltext

Faster parameterized algorithms for Bicluster Editing and Flip Consensus Tree von Tsur, Dekel

“… In the Bicluster Editing (resp., Flip Consensus Tree) problem the input is a bipartite graph G=(V1,V2,E) and an integer k, and the goal is to decide whether …”
Volltext

Faster deterministic algorithm for Co-Path Set von Tsur, Dekel

“… •We give a deterministic O⁎(2k)-time algorithm for Co-Path Set.•Our result improves the result of Zhang et al. for this problem which gave an O⁎(2.45k)-time …”
Volltext

Faster algorithm for pathwidth one vertex deletion von Tsur, Dekel

“… In the Pathwidth One Vertex Deletion (POVD) problem the input is a graph G and an integer k, and the goal is to decide whether there is a set of at most k …”
Volltext

Faster parameterized algorithm for Bicluster Editing von Tsur, Dekel

“… •We give an O⁎(2.636k)-time algorithm for Bicluster Editing.•Our algorithm is faster than previous algorithms for this problem.•The algorithm uses branching …”
Volltext

Faster deterministic algorithm for Cactus Vertex Deletion von Tsur, Dekel

“… In the Cactus Vertex Deletion (resp., Even Cycle Transversal) problem, the input is a graph G and an integer k, and the goal is to decide whether there is a …”
Volltext

A lightweight semi-centralized strategy for the massive parallelization of branching algorithms von Pastrana-Cruz, Andres, Lafond, Manuel

“… Several NP-hard problems are solved exactly using exponential-time branching strategies, whether it be branch-and-bound algorithms, or bounded search trees in …”
Volltext

Faster algorithms for cograph edge modification problems von Tsur, Dekel

“… •We give an O⁎(2.303k)-time algorithm for Cograph Deletion.•We give an O⁎(4.329k)-time algorithm for Cograph Editing.•Our algorithms are faster than the …”
Volltext

Faster parameterized algorithm for pumpkin vertex deletion set von Tsur, Dekel

“… A directed graph G is called a pumpkin if G is a union of induced directed paths with a common start vertex s and a common end vertex t, and the internal …”
Volltext

Faster parameterized algorithms for variants of 3-Hitting Set von Tsur, Dekel

“… In the A -Multi 3 -Hitting Set problem ( A -M3HS), where A ⊆ { 1 , 2 , 3 } , the input is a hypergraph G in which the hyperedges have sizes at most 3 and an …”
Volltext

Faster Graph Coloring in Polynomial Space von Gaspers, Serge, Lee, Edward J.

“… We present a polynomial-space algorithm that computes the number of independent sets of any input graph in time O ( 1 . 1389 n ) for graphs with maximum degree …”
Volltext

A Refined Branching Algorithm for the Maximum Satisfiability Problem von Li, Wenjun, Xu, Chao, Yang, Yongjie, Chen, Jianer, Wang, Jianxin

“… The Maximum satisfiability problem ( MaxSAT ) is a fundamental NP-hard problem which has significant applications in many areas. Based on refined observations, …”
Volltext

Ordered Time-Sensitive Target Allocation Strategies Based on Deep Learning von Xu, Pengfei, Guo, Pengsong

“… Aiming at the problem of "order-based" target allocation for time-sensitive targets, we analyze the situation in depth, establish the target optimization model …”
Volltext

DB+-tree: A new variant of B+-tree for main-memory database systems von Kwon, Yongsik, Lee, Seonho, Nam, Yehyun, Na, Joong Chae, Park, Kunsoo, Cha, Sang K., Moon, Bongki

“… The B-tree and its variants are an indispensable tool for database systems and applications. Hence the efficiency of the B-tree is one of the few critical …”
Volltext

The perfect matching cut problem revisited von Le, Van Bang, Telle, Jan Arne

“… In a graph, a perfect matching cut is an edge cut that is a perfect matching. perfect matching cut (pmc) is the problem of deciding whether a given graph has a …”
Volltext

Matching Cut in Graphs with Large Minimum Degree von Chen, Chi-Yeh, Hsieh, Sun-Yuan, Le, Hoang-Oanh, Le, Van Bang, Peng, Sheng-Lung

“… In a graph, a matching cut is an edge cut that is a matching. M atching C ut is the problem of deciding whether or not a given graph has a matching cut, which …”
Volltext

Partition on trees with supply and demand: Kernelization and algorithms von Lin, Mugang, Feng, Qilong, Chen, Jianer, Li, Wenjun

“… Network reconfiguration is an important research topic in the planning and operation of power distribution networks. In this paper, we study the partition …”
Volltext

Solving the multi-objective Hamiltonian cycle problem using a Branch-and-Fix based algorithm von Murua, M., Galar, D., Santana, R.

“… The Hamiltonian cycle problem consists of finding a cycle in a given graph that passes through every single vertex exactly once, or determining that this …”
Volltext