Amanote Research
Register
Sign In
A Fast Parallel Algorithm to Recognize P4-Sparse Graphs
Discrete Applied Mathematics
- Netherlands
doi 10.1016/s0166-218x(97)00085-1
Full Text
Open PDF
Abstract
Available in
full text
Categories
Combinatorics
Applied Mathematics
Discrete Mathematics
Date
January 1, 1998
Authors
Rong Lin
Stephan Olariu
Publisher
Elsevier BV
Related search
Fast Scrambling on Sparse Graphs
Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Parallel Symmetry-Breaking in Sparse Graphs
SIAM Journal on Discrete Mathematics
Mathematics
Fast Generation of Sparse Random Kernel Graphs
PLoS ONE
Multidisciplinary
PASTA: A Parallel Sparse Tensor Algorithm Benchmark Suite
CCF Transactions on High Performance Computing
A Fast Straight-Skeleton Algorithm Based on Generalized Motorcycle Graphs
International Journal of Computational Geometry and Applications
Geometry
Applied Mathematics
Computational Theory
Computational Mathematics
Mathematics
Theoretical Computer Science
Topology
A New Scheduling Algorithm for Parallel Sparse LU Factorization With Static Pivoting
Sparse Word Graphs: A Scalable Algorithm for Capturing Word Correlations in Topic Models
Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation Over Finite Fields
SIAM Journal on Computing
Mathematics
Computer Science
