Succinct Permutation Graphs
Open Access
- 24 September 2022
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 85 (2) , 509-543
Abstract
No abstract availableKeywords
All Related Versions
This publication has 31 references indexed in Scilit:
- Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation GraphsAlgorithmica, 2009
- Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisetsACM Transactions on Algorithms, 2007
- An optimal algorithm for finding the minimum cardinality dominating set on permutation graphsDiscrete Applied Mathematics, 2000
- Modular decomposition and transitive orientationDiscrete Mathematics, 1999
- Bipartite permutation graphsDiscrete Applied Mathematics, 1987
- Circular permutation graphsNetworks, 1982
- On testing isomorphism of permutation graphsNetworks, 1981
- A unifying look at data structuresCommunications of the ACM, 1980
- Transitive Orientation of Graphs and Identification of Permutation GraphsCanadian Journal of Mathematics, 1971
- Partially Ordered SetsAmerican Journal of Mathematics, 1941