BibTeX record conf/focs/DahlhausK89

download as .bib file

@inproceedings{DBLP:conf/focs/DahlhausK89,
  author       = {Elias Dahlhaus and
                  Marek Karpinski},
  title        = {An Efficient Parallel Algorithm for the Minimal Elimination Ordering
                  {(MEO)} of an Arbitrary Graph (Extended Abstract)},
  booktitle    = {30th Annual Symposium on Foundations of Computer Science, Research
                  Triangle Park, North Carolina, USA, 30 October - 1 November 1989},
  pages        = {454--459},
  publisher    = {{IEEE} Computer Society},
  year         = {1989},
  url          = {https://doi.org/10.1109/SFCS.1989.63518},
  doi          = {10.1109/SFCS.1989.63518},
  timestamp    = {Thu, 23 Mar 2023 23:57:51 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/DahlhausK89.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.