http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
EFFICIENT ALGORITHMS TO COMPUTE ALL ARTICULATION POINTS OF A PERMUTATION GRAPH
Pal, Madhumangal 한국전산응용수학회 1998 Journal of applied mathematics & informatics Vol.5 No.1
Based on the geometric representation an efficient al-gorithm is designed to find all articulation points of a permutation graph. The proposed algorithm takes only O(n log n) time and O(n) space where n represents the number of vertices. The proposed se-quential algorithm can easily be implemented in parallel which takes O(log n) time and O(n) processors on an EREW PRAM. These are the first known algorithms for the problem on this class of graph.
An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
Anita Saha,Madhumangal Pal,Tapan K. Pal 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.17 No.1-2
The shortest-paths problem is a undamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents an O(n2) time sequential algorithm and an O(n2/p + log n) time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, where p and n represent respectively the number of processors and the number of vertices of the circular-arc graph.
An efficient PRAM algorithm for maximum-weightindependent set on permutation graphs
Anita Saha,Madhumangal Pal,Tapan K. Pal 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.19 No.1-2
An efficient parallel algorithm is presented to find a maximum weight independent set of a permutation graph which takes O(log n) time using O(n2/ log n) processors on an EREW PRAM, provided the graph has at most O(n) maximal independent sets. The best known parallel algorithm takes O(log2 n) time and O(n3/ log n) processors on a CREW PRAM.
Transitive and strongly transitive intuitionistic fuzzy matrices
Rajkumar Pradhan,Madhumangal Pal 원광대학교 기초자연과학연구소 2017 ANNALS OF FUZZY MATHEMATICS AND INFORMATICS Vol.13 No.4
In this paper, some general properties of transitive intuitionistic fuzzy matrices are studied. Here it is shown that, any intuitionistic fuzzy matrix can be represent as a sum of a nilpotent matrix and a symmetric matrix. The definition of strongly transitive intuitionistic fuzzy matrix is given. Finally, the canonical form of both the transitive and strongly transitive intuitonistic fuzzy matrices are given.
AN EFFICIENT PRAM ALGORITHM FOR MAXIMUM-WEIGHT INDEPENDENT SET ON PERMUTATION GRAPHS
SAHA, ANITA,PAL, MADHUMANGAL,PAL, TAPAN K. 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.19 No.1
An efficient parallel algorithm is presented to find a maximum weight independent set of a permutation graph which takes O(log n) time using O($n^2$/ log n) processors on an EREW PRAM, provided the graph has at most O(n) maximal independent sets. The best known parallel algorithm takes O($log^2n$) time and O($n^3/log\;n$) processors on a CREW PRAM.
AN OPTIMAL PARALLEL ALGORITHM FOR SOLVING ALL-PAIRS SHORTEST PATHS PROBLEM ON CIRCULAR-ARC GRAPHS
SAHA, ANITA,PAL, MADHUMANGAL,PAL, TAPAN K. 한국전산응용수학회 2005 Journal of applied mathematics & informatics Vol.17 No.1
The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents an $O(n^2)$ time sequential algorithm and an $O(n^2/p+logn)$ time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, where p and n represent respectively the number of processors and the number of vertices of the circular-arc graph.
AN EFFICIENT ALGORITHM TO SOLVE CONNECTIVITY PROBLEM ON TRAPEZOID GRAPHS
Ghosh, Prabir K.,Pal, Madhumangal 한국전산응용수학회 2007 Journal of applied mathematics & informatics Vol.24 No.1
The connectivity problem is a fundamental problem in graph theory. The best known algorithm to solve the connectivity problem on general graphs with n vertices and m edges takes $O(K(G)mn^{1.5})$ time, where K(G) is the vertex connectivity of G. In this paper, an efficient algorithm is designed to solve vertex connectivity problem, which takes $O(n^2)$ time and O(n) space for a trapezoid graph.