default search action

combined dblp search
author search
venue search
publication search

ask others

"Polar permutation graphs are polynomial-time recognisable."

Tínaz Ekim, Pinar Heggernes, Daniel Meister (2013)

> Home

Details and statistics

DOI: 10.1016/J.EJC.2011.12.007

access: open

type: Journal Article

metadata version: 2024-02-05

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/ejc/EkimHM13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/EkimHM13
Tínaz Ekim, Pinar Heggernes, Daniel Meister:
Polar permutation graphs are polynomial-time recognisable. Eur. J. Comb. 34(3): 576-592 (2013)

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.