"A polynomial-time algorithm for near-unanimity graphs."

Benoît Larose, Cynthia Loten, László Zádori (2005)

> Home

Details and statistics

DOI: 10.1016/J.JALGOR.2004.04.011

access: closed

type: Journal Article

metadata version: 2019-07-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/LaroseLZ05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/LaroseLZ05
Benoît Larose, Cynthia Loten, László Zádori:
A polynomial-time algorithm for near-unanimity graphs. J. Algorithms 55(2): 177-191 (2005)

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.