Algorithms for parallel k-vertex connectivity and sparse certificates
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Directed s-t numberings, rubber bands, and testing digraph k-vertex connectivity
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Fully dynamic planarity testing with applications
Journal of the ACM (JACM)
Chain decompositions and independent trees in 4-connected graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Finding Independent Spanning Trees in Partial k-Trees
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A Linear-Time Algorithm to Find Independent Spanning Trees in Maximal Planar Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Completely Independent Spanning Trees in Maximal Planar Graphs
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Reliable broadcasting in product networks with Byzantine faults
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
Parallel construction of optimal independent spanning trees on hypercubes
Parallel Computing
Reducing the Height of Independent Spanning Trees in Chordal Rings
IEEE Transactions on Parallel and Distributed Systems
Constructing edge-disjoint spanning trees in locally twisted cubes
Theoretical Computer Science
On the independent spanning trees of recursive circulant graphs G(cdm,d) with d2
Theoretical Computer Science
Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
Information Processing Letters
Constructing edge-disjoint spanning trees in twisted cubes
Information Sciences: an International Journal
A plane graph representation of triconnected graphs
Theoretical Computer Science
Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
Information Processing Letters
Constructing independent spanning trees for locally twisted cubes
Theoretical Computer Science
Independent spanning trees on even networks
Information Sciences: an International Journal
Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
Discrete Applied Mathematics
Optimal Independent Spanning Trees on Odd Graphs
The Journal of Supercomputing
Independent spanning trees on twisted cubes
Journal of Parallel and Distributed Computing
On identifying additive link metrics using linearly independent cycles and paths
IEEE/ACM Transactions on Networking (TON)
An algorithm to construct independent spanning trees on parity cubes
Theoretical Computer Science
Independent spanning trees in crossed cubes
Information Sciences: an International Journal
Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
Journal of Parallel and Distributed Computing
Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes
The Journal of Supercomputing
Construction of optimal independent spanning trees on folded hypercubes
Information Sciences: an International Journal
| Hi-index | 0.01 |