English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 DetailsSummary
  An Efficient Algorithm for the Configuration Problem of Dominance Graphs

Althaus, E., Duchier, D., Koller, A., Mehlhorn, K., Niehren, J., & Thiel, S. (2001). An Efficient Algorithm for the Configuration Problem of Dominance Graphs. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01) (pp. 815-824). New York: ACM.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3136-3 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-3138-0
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Althaus, Ernst1, Author           
Duchier, Denys, Author
Koller, Alexander, Author
Mehlhorn, Kurt1, Author           
Niehren, Joachim, Author
Thiel, Sven1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show
hide
Free keywords: -
 Abstract: Dominance constraints are logical tree descriptions originating from automata theory that have multiple applications in computational linguistics. The satisfiability problem of dominance constraints is NP-complete. In most applications, however, only \emph{normal} dominance constraints are used. The satisfiability problem of normal dominance constraints can be reduced in linear time to the configuration problem of dominance graphs, as shown recently. In this paper, we give a polynomial time algorithm testing configurability of dominance graphs (and thus satisfiability of normal dominance constraints). Previous to our work no polynomial time algorithms were known.

Details

show
hide
Language(s): eng - English
 Dates: 2002-03-222001
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 344446
Other: Local-ID: C1256428004B93B8-5CB5B8108188485BC12569D600303F32-ADKMNT2001
 Degree: -

Event

show
hide
Title: SODA 2001
Place of Event: Washington DC, USA
Start-/End Date: 2001-01-07 - 2001-01-07

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-01)
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 815 - 824 Identifier: ISBN: 0-89871-490-7