Finding Disjoint Paths in Split Graphs

2014 ◽  
pp. 315-326 ◽  
Author(s):  
Pinar Heggernes ◽  
Pim van ’t Hof ◽  
Erik Jan van Leeuwen ◽  
Reza Saei
Keyword(s):  
Disjoint Paths ◽  
Split Graphs

Finding Disjoint Paths in Split Graphs

2014 ◽  
Vol 57 (1) ◽  
pp. 140-159 ◽  
Author(s):  
Pinar Heggernes ◽  
Pim van ’t Hof ◽  
Erik Jan van Leeuwen ◽  
Reza Saei
Keyword(s):  
Disjoint Paths ◽  
Split Graphs

Disjoint paths of bounded length in large generalized cycles

1999 ◽  
Vol 197-198 (1-3) ◽  
pp. 285-298 ◽  
Author(s):  
D Ferrero
Keyword(s):  
Disjoint Paths

Graphic sequences and split graphs

2016 ◽  
Vol 32 (4) ◽  
pp. 1005-1014
Author(s):  
Jian-hua Yin ◽  
Lei Meng ◽  
Meng-Xiao Yin
Keyword(s):  
Split Graphs

Split graphs

2021 ◽  
pp. 189-206
Author(s):  
Karen L. Collins ◽  
Ann N. Trenk
Keyword(s):  
Split Graphs

scholarly journals The Evolution of Networks and Local Public Good Provision: A Potential Approach

Games ◽  
2021 ◽  
Vol 12 (3) ◽  
pp. 55
Author(s):  
Markus Kinateder ◽  
Luca Paolo Merlino
Keyword(s):  
Public Good ◽  
Nash Equilibria ◽  
Potential Game ◽  
Public Good Provision ◽  
Local Public Good ◽  
Steady State Distribution ◽  
State Distribution ◽  
Long Run ◽  
Split Graphs ◽  
Good Provision

In this paper, we propose a game in which each player decides with whom to establish a costly connection and how much local public good is provided when benefits are shared among neighbors. We show that, when agents are homogeneous, Nash equilibrium networks are nested split graphs. Additionally, we show that the game is a potential game, even when we introduce heterogeneity along several dimensions. Using this result, we introduce stochastic best reply dynamics and show that this admits a unique and stationary steady state distribution expressed in terms of the potential function of the game. Hence, even if the set of Nash equilibria is potentially very large, the long run predictions are sharp.

scholarly journals Cycle partitions of regular graphs

2020 ◽  
pp. 1-24
Author(s):  
Vytautas Gruslys ◽  
Shoham Letzter
Keyword(s):  
Regular Graph ◽  
Bipartite Graphs ◽  
Disjoint Paths ◽  
Regular Graphs ◽  
Simple Construction ◽  
Vertex Set ◽  
Almost All ◽  
Vertex Disjoint

Abstract Magnant and Martin conjectured that the vertex set of any d-regular graph G on n vertices can be partitioned into $n / (d+1)$ paths (there exists a simple construction showing that this bound would be best possible). We prove this conjecture when $d = \Omega(n)$ , improving a result of Han, who showed that in this range almost all vertices of G can be covered by $n / (d+1) + 1$ vertex-disjoint paths. In fact our proof gives a partition of V(G) into cycles. We also show that, if $d = \Omega(n)$ and G is bipartite, then V(G) can be partitioned into n/(2d) paths (this bound is tight for bipartite graphs).

scholarly journals On Structural Parameterizations of the Edge Disjoint Paths Problem

Algorithmica ◽  
2021 ◽  
Author(s):  
Robert Ganian ◽  
Sebastian Ordyniak ◽  
M. S. Ramanujan
Keyword(s):  
Polynomial Time ◽  
Disjoint Paths ◽  
Structural Parameter ◽  
Input Graph ◽  
Feedback Vertex Set ◽  
Fpt Algorithms ◽  
Edge Disjoint ◽  
Fpt Algorithm ◽  
Vertex Set ◽  
Terminal Pair

AbstractIn this paper we revisit the classical edge disjoint paths (EDP) problem, where one is given an undirected graph G and a set of terminal pairs P and asks whether G contains a set of pairwise edge-disjoint paths connecting every terminal pair in P. Our focus lies on structural parameterizations for the problem that allow for efficient (polynomial-time or FPT) algorithms. As our first result, we answer an open question stated in Fleszar et al. (Proceedings of the ESA, 2016), by showing that the problem can be solved in polynomial time if the input graph has a feedback vertex set of size one. We also show that EDP parameterized by the treewidth and the maximum degree of the input graph is fixed-parameter tractable. Having developed two novel algorithms for EDP using structural restrictions on the input graph, we then turn our attention towards the augmented graph, i.e., the graph obtained from the input graph after adding one edge between every terminal pair. In constrast to the input graph, where EDP is known to remain -hard even for treewidth two, a result by Zhou et al. (Algorithmica 26(1):3--30, 2000) shows that EDP can be solved in non-uniform polynomial time if the augmented graph has constant treewidth; we note that the possible improvement of this result to an FPT-algorithm has remained open since then. We show that this is highly unlikely by establishing the [1]-hardness of the problem parameterized by the treewidth (and even feedback vertex set) of the augmented graph. Finally, we develop an FPT-algorithm for EDP by exploiting a novel structural parameter of the augmented graph.

Scheme to Find k Disjoint Paths in Multi-Cost

2011 ◽  
Author(s):  
Ruchaneeya Leepila ◽  
Eiji Oki ◽  
Naoto Kishi
Keyword(s):  
Disjoint Paths

scholarly journals Bandwidth scheduling for big data transfer with two variable node-disjoint paths

2020 ◽  
Vol 22 (2) ◽  
pp. 130-144
Author(s):  
Aiqin Hou ◽  
Chase Qishi Wu ◽  
Liudong Zuo ◽  
Xiaoyang Zhang ◽  
Tao Wang ◽  
...  
Keyword(s):  
Big Data ◽  
Data Transfer ◽  
Disjoint Paths ◽  
Bandwidth Scheduling ◽  
Variable Node
Sign in / Sign up

Export Citation Format

Share Document