path packing
Recently Published Documents

TOTAL DOCUMENTS

15
(FIVE YEARS 1)

H-INDEX

3
(FIVE YEARS 0)
Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

scholarly journals Local improvement algorithms for a path packing problem: A performance analysis based on linear programming

2021 ◽  
Vol 49 (1) ◽  
pp. 62-68
Author(s):  
K.M.J. De Bontridder ◽  
B.V. Halldórsson ◽  
M.M. Halldórsson ◽  
C.A.J. Hurkens ◽  
J.K. Lenstra ◽  
...  
Keyword(s):  
Linear Programming ◽  
Performance Analysis ◽  
Packing Problem ◽  
Local Improvement ◽  
Path Packing ◽  
A Performance

scholarly journals Parameterized Complexity of $$(A,\ell )$$-Path Packing

2020 ◽  
pp. 43-55
Author(s):  
Rémy Belmonte ◽  
Tesshu Hanaka ◽  
Masaaki Kanzaki ◽  
Masashi Kiyomi ◽  
Yasuaki Kobayashi ◽  
...  
Keyword(s):  
Parameterized Complexity ◽  
Path Packing

A polynomial-time algorithm of finding a minimum k-path vertex cover and a maximum k-path packing in some graphs

2019 ◽  
Vol 14 (6) ◽  
pp. 1317-1322
Author(s):  
D. B. Mokeev ◽  
D. S. Malyshev
Keyword(s):  
Polynomial Time ◽  
Vertex Cover ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Path Packing

scholarly journals 0/1/All CSPs, Half-Integral A-Path Packing, and Linear-Time FPT Algorithms

2018 ◽  
Author(s):  
Yoichi Iwata ◽  
Yutaro Yamaguchi ◽  
Yuichi Yoshida
Keyword(s):  
Linear Time ◽  
Fpt Algorithms ◽  
Path Packing

scholarly journals Shortest $$(A+B)$$-Path Packing Via Hafnian

Algorithmica ◽  
2017 ◽  
Vol 80 (8) ◽  
pp. 2478-2491 ◽  
Author(s):  
Hiroshi Hirai ◽  
Hiroyuki Namba
Keyword(s):  
Path Packing

scholarly journals A Note on $\mathtt{V}$-free 2-matchings

10.37236/5258 ◽  
2016 ◽  
Vol 23 (4) ◽  
Author(s):  
Kristóf Bérczi ◽  
Attila Bernáth ◽  
Máté Vizer
Keyword(s):  
Bipartite Graph ◽  
Packing Problem ◽  
Bipartite Graphs ◽  
Matching Problem ◽  
Hypergraph Matching ◽  
Path Packing ◽  
Np Complete

Motivated by a conjecture of Liang, we introduce a restricted path packing problem in bipartite graphs that we call a $\mathtt{V}$-free $2$-matching. We verify the conjecture through a weakening of the hypergraph matching problem. We close the paper by showing that it is NP-complete to decide whether one of the color classes of a bipartite graph can be covered by a $\mathtt{V}$-free $2$-matching.

Randomized parameterized algorithms for $$P_2$$ P 2 -Packing and Co-Path Packing problems

2013 ◽  
Vol 29 (1) ◽  
pp. 125-140 ◽  
Author(s):  
Qilong Feng ◽  
Jianxin Wang ◽  
Shaohua Li ◽  
Jianer Chen
Keyword(s):  
Parameterized Algorithms ◽  
Packing Problems ◽  
Path Packing

scholarly journals On the fractionality of the path packing problem

2011 ◽  
Vol 24 (4) ◽  
pp. 526-539
Author(s):  
Natalia Vanetik
Keyword(s):  
Packing Problem ◽  
Path Packing

Bounded-size Path Packing Problems

2010 ◽  
pp. 455-493
Author(s):  
Jrme Monnot ◽  
Sophie Toulouse
Keyword(s):  
Packing Problems ◽  
Path Packing ◽  
Bounded Size

scholarly journals A Deterministic Approximation Algorithm for Maximum 2-Path Packing

2010 ◽  
Vol E93-D (2) ◽  
pp. 241-249 ◽  
Author(s):  
Ruka TANAHASHI ◽  
Zhi-Zhong CHEN
Keyword(s):  
Approximation Algorithm ◽  
Path Packing
Load More ...
Sign in / Sign up

Export Citation Format

Share Document