Showing 1 - 20 of 86

1

An efficient algorithm for constructing Hamiltonian paths in meshes
Chen, Shao ; Shen, Hong ; Topor, Rodney William
Parallel Computing. 28:1293-1305

Sequential and parallel... Meshes Performance evaluation 0202 electrical engineer... Distributed computing an... 0102 computer and inform...
Academic journal
Save to List
2

Recognition algorithm for intersection graphs of edge disjoint paths in a tree
S. P. Mohanty ; Bhawani Sankar Panda
Information Processing Letters. 49:139-143

Analysis of algorithms a... edge-disjoint paths 0102 computer and inform... characterizations intersection graphs parallel NC algorithm
Academic journal
Save to List
3

A note on the reconstruction of a binary tree from its traversals
Gabrani, Naveen ; Shankar, Priti
Information Processing Letters. 42:117-119

binary tree Data structures Analysis of algorithms a... preorder and inorder tra... School of Automation) 0102 computer and inform...
Academic journal
Save to List
4

An efficient parallel algorithm for constructing a breadth first searching tree of a trapezoid graph
Honma, Hirotoshi

Graph theory (including... Parallel algorithms in c... linear time sequential a...
Academic journal
Save to List
5

Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth
Koh, Zhuan Khye ; Weinstein, Omri ; Yingchareonthawornchai, Sorrachai ; et al.

Electronic Resource
Save to List
6

NEAR-LINEAR TIME CONSTRUCTION OF SPARSE NEIGHBORHOOD COVERS.
Awerbuch, Baruch ; Berger, Bonnie ; Cowen, Lenore ; et al.
SIAM Journal on Computing. 1998, Vol. 28 Issue 1, p263. 15p.

ALGORITHMS GRAPHIC methods QUADRATIC fields
Academic journal
Save to List
7

Fast parallel and sequential algorithms for edge-coloring planar graphs.
Goos, G. ; Hartmanis, J. ; Barstow, D. ; et al.
VLSI Algorithms & Architectures. 1988, p11-23. 13p.

Book
Save to List
8

THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS
G. P. Bhattacharjee ; Madhumangal Pal
Parallel Algorithms and Applications. 7:193-207

0211 other engineering a... 0102 computer and inform... 02 engineering and techn... 01 natural sciences
Academic journal
Save to List
9

The optimal sequential and parallel algorithms to compute all hinge vertices on interval graphs.
Bera, Debashis ; Pal, Madhumangal ; Pal, Tapan K.
Journal of Applied Mathematics & Computing; May2001, Vol. 8 Issue 2, p295-309, 15p

Academic journal
Save to List
10

Recognizing Unordered Depth-First Search Trees of an Undirected Graph in Parallel.
Chen-Hsing Peng ; Biing-Feng Wang
IEEE Transactions on Parallel & Distributed Systems. Jun2000, Vol. 11 Issue 6, p559. 12p. 3 Black and White Photographs, 10 Diagrams.

SEQUENTIAL analysis PARALLEL algorithms
Academic journal
Save to List
11

Optimal parallel algorithms for rectilinear link-distance problems
Lingas, A. (A.) ; Maheshwari, A. (Anil) ; Sack, J.-R. (Jörg-Rüdiger) ; et al.
Algorithmica vol. 14 no. 3, pp. 261-289

Electronic Resource
Save to List
12

Optimal parallel algorithms for rectilinear link-distance problems.
Lingas, A. ; Maheshwari, A. ; Sack, J.
Algorithmica; Sep1995, Vol. 14 Issue 3, p261-289, 29p

Academic journal
Save to List
13

Finding the closed partition of a planar graph.
Ramachandran, Vijaya ; Yang, Honghua
Algorithmica; May1994, Vol. 11 Issue 5, p443-468, 26p

Academic journal
Save to List
14

An optimal EREW PRAM algorithm for minimum spanning tree verification.
King, Valerie ; Poon, Chung Keung
Information Processing Letters. 05/14/97, Vol. 62 Issue 3, p153. 7p.

TREE graphs
Academic journal
Save to List
15

Some optimal parallel algorithms on interval and circular-arc graphs
HSU, F. R ; SHAN, M. K ; CHAO, H. S ; et al.
Journal of information science and engineering. 21(3):627-642

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences
Academic journal
Save to List
16

Near-linear time construction of sparse neighborhood covers
AWERBUCH, B ; BERGER, B ; COWEN, L ; et al.
SIAM journal on computing (Print). 28(1):263-277

Computer science Informatique Mathematics Mathématiques Sciences exactes et tech... Exact sciences and techn...
Academic journal
Save to List
17

On testing consecutive-ones property in parallel
ANNEXSTEIN, F ; SWAMINATHAN, R
Computational molecular biology DAM - CMB Series. Volume 2Discrete applied mathematics. 88(1-3):7-28

Control theory, operatio... Automatique, recherche o... Computer science Informatique Mathematics Mathématiques
Academic journal
Save to List
18

Edge-coloring partial k-trees
ZHOU, X ; NAKANO, S.-I ; NISHIZEKI, T
Journal of algorithms (Print). 21(3):598-617

Computer science Informatique Mathematics Mathématiques Sciences exactes et tech... Exact sciences and techn...
Academic journal
Save to List
19

Recognition algorithm for intersection graphs of edge disjoint paths in a tree
PANDA, B. S ; MOHANTY, S. P
Information processing letters. 49(3):139-143

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences
Academic journal
Save to List
20

Bisections and ham-sandwich cuts of convex polygons and polyhedra
STOJMENOVIC, I
Information processing letters. 38(1):15-21

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences
Academic journal
Save to List

Filter