AAAAAA

   
Results: 1-22 |
Results: 22
WEIGHTED IRREDUNDANCE OF INTERVAL-GRAPHS
Authors: CHANG MS NAGAVAMSI P RANGAN CP
Citation: Ms. Chang et al., WEIGHTED IRREDUNDANCE OF INTERVAL-GRAPHS, Information processing letters, 66(2), 1998, pp. 65-70
RESTRICTIONS OF MINIMUM SPANNER PROBLEMS
Authors: VENKATESAN G ROTICS U MADANLAL MS MAKOWSKY JA RANGAN CP
Citation: G. Venkatesan et al., RESTRICTIONS OF MINIMUM SPANNER PROBLEMS, Information and computation, 136(2), 1997, pp. 143-164
ALL-PAIRS-SHORTEST-LENGTH ON STRONGLY CHORDAL GRAPHS
Authors: BALACHANDHRAN V RANGAN CP
Citation: V. Balachandhran et Cp. Rangan, ALL-PAIRS-SHORTEST-LENGTH ON STRONGLY CHORDAL GRAPHS, Discrete applied mathematics, 69(1-2), 1996, pp. 169-182
THE PARITY PATH PROBLEM ON SOME SUBCLASSES OF PERFECT GRAPHS
Authors: SATYAN CR RANGAN CP
Citation: Cr. Satyan et Cp. Rangan, THE PARITY PATH PROBLEM ON SOME SUBCLASSES OF PERFECT GRAPHS, Discrete applied mathematics, 68(3), 1996, pp. 293-302
OPTIMAL PARALLEL ALGORITHM FOR FINDING ST-AMBITUS OF A PLANAR BICONNECTED GRAPH
Authors: EASWARAKUMAR KS KRISHNAN SV RANGAN CP SESHADRI S
Citation: Ks. Easwarakumar et al., OPTIMAL PARALLEL ALGORITHM FOR FINDING ST-AMBITUS OF A PLANAR BICONNECTED GRAPH, Algorithmica, 15(3), 1996, pp. 242-255
APPROXIMATE TRICLIQUE COLORING FOR REGISTER ALLOCATION
Authors: VENKATESAN G RANGAN CP
Citation: G. Venkatesan et Cp. Rangan, APPROXIMATE TRICLIQUE COLORING FOR REGISTER ALLOCATION, Information processing letters, 60(5), 1996, pp. 249-253
AN EFFICIENT DISTRIBUTED ALGORITHM FOR CENTERING A SPANNING TREE OF ABICONNECTED GRAPH
Authors: ARANHA RFM RANGAN CP
Citation: Rfm. Aranha et Cp. Rangan, AN EFFICIENT DISTRIBUTED ALGORITHM FOR CENTERING A SPANNING TREE OF ABICONNECTED GRAPH, Information processing letters, 59(3), 1996, pp. 145-150
TREE 3-SPANNERS ON INTERVAL, PERMUTATION AND REGULAR BIPARTITE GRAPHS
Authors: MADANLAL MS VENKATESAN G RANGAN CP
Citation: Ms. Madanlal et al., TREE 3-SPANNERS ON INTERVAL, PERMUTATION AND REGULAR BIPARTITE GRAPHS, Information processing letters, 59(2), 1996, pp. 97-102
CLIQUE TRANSVERSAL AND CLIQUE INDEPENDENCE ON COMPARABILITY-GRAPHS
Authors: BALACHANDRAN V NAGAVAMSI P RANGAN CP
Citation: V. Balachandran et al., CLIQUE TRANSVERSAL AND CLIQUE INDEPENDENCE ON COMPARABILITY-GRAPHS, Information processing letters, 58(4), 1996, pp. 181-184
WEIGHTED INDEPENDENT PERFECT DOMINATION ON COCOMPARABILITY GRAPHS
Authors: CHANG GJ RANGAN CP COORG SR
Citation: Gj. Chang et al., WEIGHTED INDEPENDENT PERFECT DOMINATION ON COCOMPARABILITY GRAPHS, Discrete applied mathematics, 63(3), 1995, pp. 215-222
PARALLEL ALGORITHMS ON INTERVAL-GRAPHS
Authors: BALAYOGAN VB RANGAN CP
Citation: Vb. Balayogan et Cp. Rangan, PARALLEL ALGORITHMS ON INTERVAL-GRAPHS, Informatique theorique et applications, 29(6), 1995, pp. 451-470
EFFICIENT DYNAMIC JOB SCHEDULING ALGORITHMS FOR MULTIPROCESSOR SYSTEMS
Authors: MAHESH S MURTHY CSR RANGAN CP
Citation: S. Mahesh et al., EFFICIENT DYNAMIC JOB SCHEDULING ALGORITHMS FOR MULTIPROCESSOR SYSTEMS, IEICE transactions on information and systems, E78D(1), 1995, pp. 3-12
EFFICIENT PARALLEL ALGORITHMS FOR PERMUTATION GRAPHS
Authors: ARVIND K KAMAKOTI V RANGAN CP
Citation: K. Arvind et al., EFFICIENT PARALLEL ALGORITHMS FOR PERMUTATION GRAPHS, Journal of parallel and distributed computing, 26(1), 1995, pp. 116-124
OPTIMAL PARALLEL ALGORITHMS FOR PATH PROBLEMS ON PLANAR GRAPHS
Authors: SRIKRISHNA G RANGAN CP
Citation: G. Srikrishna et Cp. Rangan, OPTIMAL PARALLEL ALGORITHMS FOR PATH PROBLEMS ON PLANAR GRAPHS, Theoretical computer science, 145(1-2), 1995, pp. 27-43
SYSTEMATIC DESIGN OF AN ALGORITHM FOR BICONNECTED COMPONENTS
Authors: MADHUKAR K KUMAR DP RANGAN CP SUNDAR R
Citation: K. Madhukar et al., SYSTEMATIC DESIGN OF AN ALGORITHM FOR BICONNECTED COMPONENTS, Science of computer programming, 25(1), 1995, pp. 63-77
FEEDBACK VERTEX SET ON COCOMPARABILITY GRAPHS
Authors: COORG SR RANGAN CP
Citation: Sr. Coorg et Cp. Rangan, FEEDBACK VERTEX SET ON COCOMPARABILITY GRAPHS, Networks, 26(2), 1995, pp. 101-111
MODELING AND SIMULATION OF DYNAMIC JOB SCHEDULING IN MULTIPROCESSOR SYSTEMS
Authors: MAHESH S MURTHY CSR GONSALVES TA RANGAN CP
Citation: S. Mahesh et al., MODELING AND SIMULATION OF DYNAMIC JOB SCHEDULING IN MULTIPROCESSOR SYSTEMS, International journal of computer mathematics, 58(3-4), 1995, pp. 221-247
EDGE DOMINATION ON BIPARITE PERMUTATION GRAPHS AND COTRIANGULATED GRAPHS
Authors: SRINIVASAN A MADHUKAR K NAGAVAMSI P RANGAN CP CHANG MS
Citation: A. Srinivasan et al., EDGE DOMINATION ON BIPARITE PERMUTATION GRAPHS AND COTRIANGULATED GRAPHS, Information processing letters, 56(3), 1995, pp. 165-171
TREEWIDTH OF CIRCULAR-ARC GRAPHS
Authors: SUNDARAM R SINGH KS RANGAN CP
Citation: R. Sundaram et al., TREEWIDTH OF CIRCULAR-ARC GRAPHS, SIAM journal on discrete mathematics, 7(4), 1994, pp. 647-655
TREEWIDTH OF CIRCULAR-ARC GRAPHS
Authors: SUNDARAM R SINGH KS RANGAN CP
Citation: R. Sundaram et al., TREEWIDTH OF CIRCULAR-ARC GRAPHS, SIAM journal on discrete mathematics, 7(4), 1994, pp. 647-655
A LINEAR ALGORITHM FOR CENTERING A SPANNING TREE OF A BICONNECTED GRAPH
Authors: EASWARAKUMAR KS RANGAN CP CHESTON GA
Citation: Ks. Easwarakumar et al., A LINEAR ALGORITHM FOR CENTERING A SPANNING TREE OF A BICONNECTED GRAPH, Information processing letters, 51(3), 1994, pp. 121-124
OPTIMAL PATH COVER PROBLEM ON BLOCK GRAPHS AND BIPARTITE PERMUTATION GRAPHS
Authors: SRIKANT R SUNDARAM R SINGH KS RANGAN CP
Citation: R. Srikant et al., OPTIMAL PATH COVER PROBLEM ON BLOCK GRAPHS AND BIPARTITE PERMUTATION GRAPHS, Theoretical computer science, 115(2), 1993, pp. 351-357
Risultati: 1-22 |