English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

An Efficient Algorithm for the Configuration Problem of Dominance Graphs

MPS-Authors
/persons/resource/persons44003

Althaus,  Ernst
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45021

Mehlhorn,  Kurt
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45615

Thiel,  Sven
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Althaus, E., Duchier, D., Koller, A., Mehlhorn, K., Niehren, J., & Thiel, S. (2003). An Efficient Algorithm for the Configuration Problem of Dominance Graphs. Journal of Algorithms, 48, 194-219. doi:10.1016/S0196-6774(03)00050-6.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2C1E-E
Abstract
There is no abstract available