Augmenting weighted graphs to establish directed point-to-point connectivity

被引：0

作者：

Roayaei, Mehdy ^{[1
]}

Razzazi, Mohammadreza ^{[1
,2
]}

机构：

[1] Amirkabir Univ Technol, Dept Comp Engn & Informat Technol, POB 15875-4413,424 Hafez Ave, Tehran, Iran

[2] Inst Res Fundamental Sci IPM, Sch Comp Sci, Tehran, Iran

来源：

JOURNAL OF COMBINATORIAL OPTIMIZATION | 2017年 / 33卷 / 03期

关键词：

Graph augmentation; Point-to-point connectivity; Fixed-parameter tractability; Directed Steiner network; Parameterized algorithm; COMPLEXITY; APPROXIMATION; ALGORITHMS; DELIVERY;

D O I：

10.1007/s10878-016-0023-y

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

We consider an augmentation problem on undirected and directed graphs, where given a directed (an undirected) graph G and p pairs of vertices , one has to find the minimum weight set of arcs (edges) to be added to the graph so that the resulting graph has (can be oriented to have) directed paths between the specified pairs of vertices. In the undirected case, we present an FPT-algorithm with respect to the number of new edges. Also, we have implemented and evaluated the algorithm on some real-world networks to show its efficiency in decreasing the size of input graphs and converting them to much smaller kernels. In the directed case, we consider the complexity of the problem with respect to the various parameters and present some parameterized algorithms and parameterized complexity results for it.

引用

页码：1030 / 1056

页数：27

共 50 条

[1] Augmenting weighted graphs to establish directed point-to-point connectivity
Mehdy Roayaei
Mohammadreza Razzazi
[J]. Journal of Combinatorial Optimization, 2017, 33 : 1030 - 1056
[2] Using Landmarks to Establish a Point-to-Point Correspondence between Signatures
K. Zhang
I. Pratikakis
J. Cornelis
E. Nyssen
[J]. Pattern Analysis & Applications, 2000, 3 : 69 - 75
[3] Using landmarks to establish a point-to-point correspondence between signatures
Zhang, K
Pratikakis, I
Cornelis, J
Nyssen, E
[J]. PATTERN ANALYSIS AND APPLICATIONS, 2000, 3 (01) : 69 - 75
[4] Minimum Cardinality Point-to-point Connectivity Augmentation Problem
Roayaei, Mehdy
Razzazi, MohammadReza
[J]. FUNDAMENTA INFORMATICAE, 2018, 160 (04) : 447 - 463
[5] Efficient Point-to-Point Resistance Distance Queries in Large Graphs
Gotsman, Craig
Hormann, Kai
[J]. Journal of Graph Algorithms and Applications, 2023, 27 (01) : 35 - 44
[6] ROTATOR GRAPHS - AN EFFICIENT TOPOLOGY FOR POINT-TO-POINT MULTIPROCESSOR NETWORKS
CORBETT, PF
[J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1992, 3 (05) : 622 - 626
[7] POINT-TO-POINT
RATNER, J
[J]. LIBRARY SOFTWARE REVIEW, 1987, 6 (05): : 312 - 314
[8] Point-to-point connectivity prediction in porous media using percolation theory
Tavagh-Mohammadi, Behnam
Masihi, Mohsen
Ganjeh-Ghazvini, Mostafa
[J]. PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2016, 460 : 304 - 313
[9] Change Point Detection in Weighted and Directed Random Dot Product Graphs
Larroca, Federico
Bermolen, Paola
Fiori, Marcelo
Mateos, Gonzalo
[J]. 29TH EUROPEAN SIGNAL PROCESSING CONFERENCE (EUSIPCO 2021), 2021, : 1810 - 1814
[10] Point-to-point connectivity between neuromorphic chips using address events
Boahen, KA
[J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2000, 47 (05) : 416 - 434

← 1 2 3 4 5 →