How Fast Can We Compute Orbits of Groups?

Anton Betten

Conference Proceedings

How Fast Can We Compute Orbits of Groups?

Betten A

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2018) 10931 LNCS 62-70

DOI: 10.1007/978-3-319-96418-8_8

5Citations

1Readers

Get full text

Abstract

Many problems in Combinatorics and related fields reduce to the problem of computing orbits of groups acting on finite sets. One of the techniques is known under the name Snakes and Ladders. We offer the alternate name poset classification algorithm. We will describe this technique and compare the performance on example problems.

Author supplied keywords

Classification
Combinatorial object
Group orbits

Cite

CITATION STYLE

APA

Betten, A. (2018). How Fast Can We Compute Orbits of Groups? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10931 LNCS, pp. 62–70). Springer Verlag. https://doi.org/10.1007/978-3-319-96418-8_8

How Fast Can We Compute Orbits of Groups?

Abstract

Author supplied keywords

Cite

Register to see more suggestions