Isolated Suborders and their Application to Counting Closure Operators
Fuente:
arXiv
Guardado en:
| Autor principal: | Glück, Roland |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Closure property of contraction-depth of matroids
por: Brianski, Marcin, et al.
Publicado: (2023)
por: Brianski, Marcin, et al.
Publicado: (2023)
Counting Tree-Like Multigraphs with a Given Number of Vertices and Multiple Edges
por: Ilyas, Muhammad, et al.
Publicado: (2025)
por: Ilyas, Muhammad, et al.
Publicado: (2025)
Counting Colored Tilings on Grids and Graphs
por: Ramírez, José L., et al.
Publicado: (2024)
por: Ramírez, José L., et al.
Publicado: (2024)
Counting the Number of Domatic Partition of a Graph
por: Alikhani, Saeid, et al.
Publicado: (2024)
por: Alikhani, Saeid, et al.
Publicado: (2024)
Graphs With the Same Edge Count in Each Neighborhood
por: Sheffield, Nathan S., et al.
Publicado: (2025)
por: Sheffield, Nathan S., et al.
Publicado: (2025)
On Closure Properties of Read-Once Oblivious Algebraic Branching Programs
por: Armand, Jules, et al.
Publicado: (2025)
por: Armand, Jules, et al.
Publicado: (2025)
Making Walks Count: From Silent Circles to Hamiltonian Cycles
por: Alekseyev, Max A., et al.
Publicado: (2016)
por: Alekseyev, Max A., et al.
Publicado: (2016)
Onion De Bruijn Sequences: Fixed-Window Counting by Growing the Alphabet
por: Genosar, Dor, et al.
Publicado: (2019)
por: Genosar, Dor, et al.
Publicado: (2019)
Extended formulations for the maximum weighted co-2-plex problem
por: Dupont-Bouillard, Alexandre, et al.
Publicado: (2025)
por: Dupont-Bouillard, Alexandre, et al.
Publicado: (2025)
Counting Answers to Unions of Conjunctive Queries: Natural Tractability Criteria and Meta-Complexity
por: Focke, Jacob, et al.
Publicado: (2023)
por: Focke, Jacob, et al.
Publicado: (2023)
Counting the minimum number of arcs in an oriented graph having weak diameter 2
por: Das, Sandip, et al.
Publicado: (2023)
por: Das, Sandip, et al.
Publicado: (2023)
Counting Subgraphs in Somewhere Dense Graphs
por: Bressan, Marco, et al.
Publicado: (2022)
por: Bressan, Marco, et al.
Publicado: (2022)
Counting of Shortest Paths in Cubic Grid
por: Dutt, Mousumi, et al.
Publicado: (2018)
por: Dutt, Mousumi, et al.
Publicado: (2018)
Gathering Information about a Graph by Counting Walks from a Single Vertex
por: Fuhlbrück, Frank, et al.
Publicado: (2024)
por: Fuhlbrück, Frank, et al.
Publicado: (2024)
Vanishing Signatures, Orbit Closure, and the Converse of the Holant Theorem
por: Cai, Jin-Yi, et al.
Publicado: (2025)
por: Cai, Jin-Yi, et al.
Publicado: (2025)
Isolation Forest in Novelty Detection Scenario
por: Ulrich, Adam, et al.
Publicado: (2025)
por: Ulrich, Adam, et al.
Publicado: (2025)
Hyper-Zagreb Indices of Hypergraphs with Application in Drug Design
por: Sanad, Abdulkafi
Publicado: (2025)
por: Sanad, Abdulkafi
Publicado: (2025)
Atomic Column Generation For Consensus Between Algorithms: Application to Path Computation
por: Martin, Sébastien, et al.
Publicado: (2025)
por: Martin, Sébastien, et al.
Publicado: (2025)
Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems
por: Auger, David, et al.
Publicado: (2024)
por: Auger, David, et al.
Publicado: (2024)
A Temporal Graph Model to Study the Dynamics of Collective Behavior and Performance in Team Sports: An Application to Basketball
por: Bourgeais, Quentin, et al.
Publicado: (2024)
por: Bourgeais, Quentin, et al.
Publicado: (2024)
Fine-Grained Expressive Power of Weisfeiler-Leman: A Homomorphism Counting Perspective
por: Zhou, Junru, et al.
Publicado: (2024)
por: Zhou, Junru, et al.
Publicado: (2024)
Contractions in perfect graph
por: Dupont-Bouillard, Alexandre, et al.
Publicado: (2024)
por: Dupont-Bouillard, Alexandre, et al.
Publicado: (2024)
Counting random $k$-SAT near the satisfiability threshold
por: Chen, Zongchen, et al.
Publicado: (2024)
por: Chen, Zongchen, et al.
Publicado: (2024)
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations
por: Focke, Jacob, et al.
Publicado: (2021)
por: Focke, Jacob, et al.
Publicado: (2021)
Subgraph Counting in Subquadratic Time for Bounded Degeneracy Graphs
por: Paul-Pena, Daniel, et al.
Publicado: (2024)
por: Paul-Pena, Daniel, et al.
Publicado: (2024)
Counting Circuit Double Covers
por: Hušek, Radek, et al.
Publicado: (2023)
por: Hušek, Radek, et al.
Publicado: (2023)
Counting simplicial pairs in hypergraphs
por: Barrett, Jordan, et al.
Publicado: (2024)
por: Barrett, Jordan, et al.
Publicado: (2024)
A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
por: Bourneuf, Romain, et al.
Publicado: (2025)
por: Bourneuf, Romain, et al.
Publicado: (2025)
A Dichotomy Theorem for Linear Time Homomorphism Orbit Counting in Bounded Degeneracy Graphs
por: Paul-Pena, Daniel, et al.
Publicado: (2022)
por: Paul-Pena, Daniel, et al.
Publicado: (2022)
Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs
por: Neuen, Daniel, et al.
Publicado: (2026)
por: Neuen, Daniel, et al.
Publicado: (2026)
Counting Polyominoes in a Rectangle b x h
por: Marin, Louis
Publicado: (2024)
por: Marin, Louis
Publicado: (2024)
Revisiting FastMap: New Applications
por: Li, Ang
Publicado: (2025)
por: Li, Ang
Publicado: (2025)
On the Incompressibility of Truth With Application to Circuit Complexity
por: Tonon, Luke
Publicado: (2025)
por: Tonon, Luke
Publicado: (2025)
Multidimensional Quantum Walks, with Application to $k$-Distinctness
por: Jeffery, Stacey, et al.
Publicado: (2022)
por: Jeffery, Stacey, et al.
Publicado: (2022)
Multidimensional Electrical Networks and their Application to Exponential Speedups for Graph Problems
por: Li, Jianqiang, et al.
Publicado: (2023)
por: Li, Jianqiang, et al.
Publicado: (2023)
Counting Locally Optimal Tours in the TSP
por: Manthey, Bodo, et al.
Publicado: (2024)
por: Manthey, Bodo, et al.
Publicado: (2024)
Application of the Quantum Approximate Optimization Algorithm in Solving the Total Domination Problem
por: Pan, Haoqian, et al.
Publicado: (2024)
por: Pan, Haoqian, et al.
Publicado: (2024)
Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model
por: Bentert, Matthias, et al.
Publicado: (2023)
por: Bentert, Matthias, et al.
Publicado: (2023)
Single machine rescheduling for new orders: properties and complexity results
por: Rener, Elena, et al.
Publicado: (2023)
por: Rener, Elena, et al.
Publicado: (2023)
Reduction for asynchronous Boolean networks: elimination of negatively autoregulated components
por: Schwieger, Robert, et al.
Publicado: (2023)
por: Schwieger, Robert, et al.
Publicado: (2023)
Ejemplares similares
-
Closure property of contraction-depth of matroids
por: Brianski, Marcin, et al.
Publicado: (2023) -
Counting Tree-Like Multigraphs with a Given Number of Vertices and Multiple Edges
por: Ilyas, Muhammad, et al.
Publicado: (2025) -
Counting Colored Tilings on Grids and Graphs
por: Ramírez, José L., et al.
Publicado: (2024) -
Counting the Number of Domatic Partition of a Graph
por: Alikhani, Saeid, et al.
Publicado: (2024) -
Graphs With the Same Edge Count in Each Neighborhood
por: Sheffield, Nathan S., et al.
Publicado: (2025)