Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings

A. Berry, R. Krueger, G. Simonet

Open source

DOI
10.1137/070684355
Published
2009-01
Container
SIAM Journal on Discrete Mathematics
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1137/070684355,
  title = {Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings},
  author = {A. Berry and R. Krueger and G. Simonet},
  year = {2009},
  journal = {SIAM Journal on Discrete Mathematics},
  doi = {10.1137/070684355},
  url = {https://doi.org/10.1137/070684355}
}

RIS

TY  - JOUR
TI  - Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings
AU  - A. Berry
AU  - R. Krueger
AU  - G. Simonet
PY  - 2009
JO  - SIAM Journal on Discrete Mathematics
DO  - 10.1137/070684355
UR  - https://doi.org/10.1137/070684355
ER  - 

APA

Berry, A., Krueger, R., & Simonet, G. (2009). Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings. SIAM Journal on Discrete Mathematics. https://doi.org/10.1137/070684355

Source records