A Fast Parallel Algorithm to Recognize P4-Sparse Graphs

Discrete Applied Mathematics - Netherlands
doi 10.1016/s0166-218x(97)00085-1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Maximum-Size Subgraphs of P4-Sparse Graphs Admitting a Perfect Matching

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Fast Scrambling on Sparse Graphs

Proceedings of the National Academy of Sciences of the United States of America
Multidisciplinary
2019English

Parallel Symmetry-Breaking in Sparse Graphs

SIAM Journal on Discrete Mathematics
Mathematics
1988English

Fast Generation of Sparse Random Kernel Graphs

PLoS ONE
Multidisciplinary
2015English

PASTA: A Parallel Sparse Tensor Algorithm Benchmark Suite

CCF Transactions on High Performance Computing
2019English

A Fast Straight-Skeleton Algorithm Based on Generalized Motorcycle Graphs

International Journal of Computational Geometry and Applications
GeometryApplied MathematicsComputational TheoryComputational MathematicsMathematicsTheoretical Computer ScienceTopology
2012English

Sparse Word Graphs: A Scalable Algorithm for Capturing Word Correlations in Topic Models

2007English

A New Scheduling Algorithm for Parallel Sparse LU Factorization With Static Pivoting

2002English

Fast Parallel Algorithms for Sparse Multivariate Polynomial Interpolation Over Finite Fields

SIAM Journal on Computing
MathematicsComputer Science
1990English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy