An orderly algorithm for generation of Condorcet Domains
Fuente:
arXiv
Guardado en:
| Autores principales: | Zhou, Bei, Markström, Klas |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Local Diversity of Condorcet Domains
por: Karpov, Alexander, et al.
Publicado: (2024)
por: Karpov, Alexander, et al.
Publicado: (2024)
Improved lower bounds for the maximum size of Condorcet domains
por: Karpov, Alexander, et al.
Publicado: (2026)
por: Karpov, Alexander, et al.
Publicado: (2026)
Arrow's single peaked domains, richness, and domains for plurality and the Borda count
por: Markström, Klas, et al.
Publicado: (2024)
por: Markström, Klas, et al.
Publicado: (2024)
A heuristic search algorithm for discovering large Condorcet domains
por: Zhou, Bei, et al.
Publicado: (2023)
por: Zhou, Bei, et al.
Publicado: (2023)
Bipartite peak-pit domains
por: Karpov, Alexander, et al.
Publicado: (2023)
por: Karpov, Alexander, et al.
Publicado: (2023)
Near Triple Arrays
por: Gordeev, Alexey, et al.
Publicado: (2025)
por: Gordeev, Alexey, et al.
Publicado: (2025)
Rainbow variations on a theme by Mantel: extremal problems for Gallai colouring templates
por: Falgas-Ravry, Victor, et al.
Publicado: (2022)
por: Falgas-Ravry, Victor, et al.
Publicado: (2022)
Enumeration of Sets of Mutually Orthogonal Latin Rectangles
por: Jäger, Gerold, et al.
Publicado: (2019)
por: Jäger, Gerold, et al.
Publicado: (2019)
Enumeration of Row-Column Designs
por: Jäger, Gerold, et al.
Publicado: (2024)
por: Jäger, Gerold, et al.
Publicado: (2024)
Las Vegas algorithms to generate universal cycles and de Bruijn sequences uniformly at random
por: Sawada, Joe, et al.
Publicado: (2025)
por: Sawada, Joe, et al.
Publicado: (2025)
Certified algorithms for numerical semigroups in Rocq
por: Bartoletti, Massimo, et al.
Publicado: (2025)
por: Bartoletti, Massimo, et al.
Publicado: (2025)
Secure Domination in Bisplit graphs -- A Structural and algorithmic study
por: D, Swathi, et al.
Publicado: (2025)
por: D, Swathi, et al.
Publicado: (2025)
Approximation algorithms for job scheduling with block-type conflict graphs
por: Furmańczyk, Hanna, et al.
Publicado: (2022)
por: Furmańczyk, Hanna, et al.
Publicado: (2022)
An incremental exact algorithm for the hyper-rectangular clustering problem with axis-parallel clusters
por: Donne, Diego Delle, et al.
Publicado: (2024)
por: Donne, Diego Delle, et al.
Publicado: (2024)
A recursive linear time modular decomposition algorithm via LexBFS
por: Corneil, Derek, et al.
Publicado: (2007)
por: Corneil, Derek, et al.
Publicado: (2007)
Modeling energy collection with shortest paths in rectangular grids: an efficient algorithm for energy harvesting
por: Díaz-Bañez, José-Miguel, et al.
Publicado: (2025)
por: Díaz-Bañez, José-Miguel, et al.
Publicado: (2025)
Axiomatic characterizations of dissimilarity orderings and distances between sets
por: Marchant, Thierry, et al.
Publicado: (2025)
por: Marchant, Thierry, et al.
Publicado: (2025)
A column generation algorithm for finding co-3-plexes in chordal graphs
por: Dupont-Bouillard, Alexandre
Publicado: (2026)
por: Dupont-Bouillard, Alexandre
Publicado: (2026)
Single machine rescheduling for new orders: properties and complexity results
por: Rener, Elena, et al.
Publicado: (2023)
por: Rener, Elena, et al.
Publicado: (2023)
Karp's patching algorithm on dense digraph
por: Frieze, Alan
Publicado: (2025)
por: Frieze, Alan
Publicado: (2025)
The Closed Geodetic Game: algorithms and strategies
por: Dailly, Antoine, et al.
Publicado: (2024)
por: Dailly, Antoine, et al.
Publicado: (2024)
Fast algorithm for $S$-packing coloring of Halin graphs
por: Zhang, Xin, et al.
Publicado: (2025)
por: Zhang, Xin, et al.
Publicado: (2025)
CDL: A fast and flexible library for the study of permutation sets with structural restrictions
por: Zhou, Bei, et al.
Publicado: (2023)
por: Zhou, Bei, et al.
Publicado: (2023)
Dual Bounded Generation: Polynomial, Second-order Cone and Positive Semidefinite Matrix Inequalities
por: Elbassioni, Khaled
Publicado: (2024)
por: Elbassioni, Khaled
Publicado: (2024)
CAZAC sequence generation of any length with iterative projection onto unit circle: principle and first results
por: Amis, Karine, et al.
Publicado: (2025)
por: Amis, Karine, et al.
Publicado: (2025)
Faster 3-colouring algorithm for graphs of diameter 3
por: Groenland, Carla, et al.
Publicado: (2026)
por: Groenland, Carla, et al.
Publicado: (2026)
Cyclic ordering of split matroids
por: Bérczi, Kristóf, et al.
Publicado: (2024)
por: Bérczi, Kristóf, et al.
Publicado: (2024)
A verified implementation of the Misra and Gries edge coloring algorithm
por: Bhoja, Arohee
Publicado: (2025)
por: Bhoja, Arohee
Publicado: (2025)
Complexity and algorithms for Arc-Kayles and Non-Disconnecting Arc-Kayles
por: Burke, Kyle, et al.
Publicado: (2024)
por: Burke, Kyle, et al.
Publicado: (2024)
On the order-diameter ratio of girth-diameter cages
por: Cambie, Stijn, et al.
Publicado: (2025)
por: Cambie, Stijn, et al.
Publicado: (2025)
Subdivisions in dicritical digraphs with large order or digirth
por: Picasarri-Arrieta, Lucas, et al.
Publicado: (2024)
por: Picasarri-Arrieta, Lucas, et al.
Publicado: (2024)
Combinatorial generation via permutation languages. VI. Binary trees
por: Gregor, Petr, et al.
Publicado: (2023)
por: Gregor, Petr, et al.
Publicado: (2023)
Automorphism groups of Cayley graphs generated by general transposition sets
por: Gijswijt, Dion, et al.
Publicado: (2024)
por: Gijswijt, Dion, et al.
Publicado: (2024)
Tree decompositions with small width, spread, order and degree
por: Wood, David R.
Publicado: (2025)
por: Wood, David R.
Publicado: (2025)
List coloring ordered graphs with forbidden induced subgraphs
por: Piecyk, Marta, et al.
Publicado: (2025)
por: Piecyk, Marta, et al.
Publicado: (2025)
On completely factoring any integer efficiently in a single run of an order finding algorithm
por: Ekerå, Martin
Publicado: (2020)
por: Ekerå, Martin
Publicado: (2020)
Asymptotic analysis and efficient random sampling of directed ordered acyclic graphs
por: Pépin, Martin, et al.
Publicado: (2023)
por: Pépin, Martin, et al.
Publicado: (2023)
Reliability evaluation of Cayley graph generated by unicyclic graphs based on cyclic fault pattern
por: Tian, Ting, et al.
Publicado: (2025)
por: Tian, Ting, et al.
Publicado: (2025)
Planar induced paths via a decomposition into non-crossing ordered graphs
por: Duron, Julien, et al.
Publicado: (2025)
por: Duron, Julien, et al.
Publicado: (2025)
Characterizing traces of processes defined by precedence and response constraints: an order theory approach
por: Dukes, Mark, et al.
Publicado: (2023)
por: Dukes, Mark, et al.
Publicado: (2023)
Ejemplares similares
-
Local Diversity of Condorcet Domains
por: Karpov, Alexander, et al.
Publicado: (2024) -
Improved lower bounds for the maximum size of Condorcet domains
por: Karpov, Alexander, et al.
Publicado: (2026) -
Arrow's single peaked domains, richness, and domains for plurality and the Borda count
por: Markström, Klas, et al.
Publicado: (2024) -
A heuristic search algorithm for discovering large Condorcet domains
por: Zhou, Bei, et al.
Publicado: (2023) -
Bipartite peak-pit domains
por: Karpov, Alexander, et al.
Publicado: (2023)