The optimal sequential and parallel algorithms to compute all hinge vertices on interval graphs

被引：0

作者：

Debashis Bera

Madhumangal Pal

Tapan K. Pal

机构：

[1] Vidyasagar University,Department of Applied Mathematics with Oceanology and Computer Programming

来源：

Korean Journal of Computational and Applied Mathematics | 2001年 / 8卷 / 2期

关键词：

68Q22; 68Q25; 68R10; Interval graph; hinge vertex; design of algorithms; analysis of algorithms; parallel algorithms;

D O I：

10.1007/BF02941967

中图分类号：

学科分类号：

摘要：

If the distance between two vertices becomes longer after the removal of a vertexu, thenu is called a hinge vertex. In this paper, a linear time sequential algorithm is presented to find all hinge vertices of an interval graph. Also, a parallel algorithm is presented which takesO(n/P + logn) time usingP processors on an EREW PRAM.

引用

页码：295 / 309

页数：14

共 50 条

[1] Optimal sequential and parallel algorithms to compute all cut vertices on trapezoid graphs
Hota, M
Pal, M
Pal, TK
[J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2004, 27 (01) : 95 - 113
[2] Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs
Mrinmoy Hota
Madhumangal Pal
Tapan K. Pal
[J]. Computational Optimization and Applications, 2004, 27 : 95 - 113
[3] Optimal sequential and parallel algorithms for cut vertices and bridges on trapezoid graphs
Chen, HC
[J]. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2004, 6 (02): : 483 - 496
[4] Optimal sequential and parallel algorithms to compute a Steiner tree on permutation graphs
Mondal, S
Pal, M
Pal, TK
[J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2003, 80 (08) : 937 - 943
[5] OPTIMAL PARALLEL ALGORITHMS FOR FINDING CUT VERTICES AND BRIDGES OF INTERVAL-GRAPHS
SPRAGUE, AP
KULKARNI, KH
[J]. INFORMATION PROCESSING LETTERS, 1992, 42 (04) : 229 - 234
[6] A parallel algorithm for finding all hinge vertices of an interval graph
[J]. Honma, H., 2001, Institute of Electronics, Information and Communication, Engineers, IEICE (E84-D)
[7] A parallel algorithm for finding all hinge vertices of an interval graph
Honma, H
Masuyama, S
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2001, E84D (03) : 419 - 423
[8] Optimal parallel algorithms for cut vertices, bridges, and Hamiltonian Path in bounded interval tolerance graphs
Adhar, GS
[J]. PROCEEDINGS OF THE EIGHTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, 2001, : 91 - 98
[9] Algorithms for Compute Independent Sets of Vertices in Graphs and Fuzzy Graphs
Cioban, V.
Prejmerean, V.
[J]. PROCEEDINGS OF 2010 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION, QUALITY AND TESTING, ROBOTICS (AQTR 2010), VOLS. 1-3, 2010,
[10] An optimal parallel algorithm for computing cut vertices and blocks on interval graphs
Pal, M
Mondal, S
Bera, D
Pal, TK
[J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2000, 75 (01) : 59 - 70

← 1 2 3 4 5 →