New bounds on support size improve optimization methods in scheduling and mixed-integer programming.
― 7 min read
Computer Science - Discrete Mathematics
RSSLatest Articles
Latest Articles
An overview of circuit polynomials and their significance in point arrangements.
― 5 min read
Examining effective strategies for playing the graph coloring game on multipartite graphs.
― 4 min read
Exploring the reconfigurability of arc-disjoint arborescences and their implications.
― 5 min read
Learn about the Weisfeiler-Leman algorithm and its impact on graph isomorphism.
― 5 min read
This research shows solvability in key semigroup problems for certain metabelian groups.
― 6 min read
Learn how S-TEGs improve process modeling across industries.
― 6 min read
A platform to analyze and visualize crowd movements in urban areas.
― 5 min read
An overview of qubit routing and its significance in quantum computing efficiency.
― 7 min read
An overview of graph parameters and their significance in various fields.
― 5 min read
Researchers optimize quantum circuit simulations using ZX-calculus and community-based strategies.
― 5 min read
This article examines the complexities of shortest paths in graph associahedra.
― 8 min read
A look into how graph convexity shapes relationships between vertices.
― 6 min read
A look into Roman domination and its impact on graph theory.
― 5 min read
This article discusses new methods for efficient prime number generation using pseudodeterministic algorithms.
― 5 min read
Investigating the fewest clues needed for unique Sudoku solutions.
― 4 min read
GTED provides a method to compare genetic sequences through graph representation.
― 5 min read
Exploring acyclic edge coloring and its significance in degenerate graphs.
― 5 min read
Examining methods to reduce the difference between two submodular functions in optimization.
― 5 min read
This paper examines the relationship between graphs and surfaces through map homomorphisms.
― 5 min read
Explore the unique structure of -representations and their links to automata.
― 6 min read
New findings in mathematics reshape our understanding of random vectors.
― 5 min read
Exploring a novel model using group structures to analyze graph relationships.
― 12 min read
A new method enhances routing and scheduling in time-dependent networks.
― 6 min read
A look into the mechanics and applications of spiking neural networks.
― 6 min read
New insights into Lee metric codes enhance data protection and error recovery.
― 5 min read
A study on Hitting Set algorithms and their average performance.
― 5 min read
Exploring methods to list minimal dominating sets in graphs and hypergraphs.
― 6 min read
Learn how compact repair groups improve data recovery in decentralized storage systems.
― 5 min read
A look at GNNs and their role in solving complex optimization problems.
― 5 min read
Learn how stack and queue numbers shape graph arrangements.
― 5 min read
Exploring the complexity of crossing numbers in almost planar and anchored planar graphs.
― 4 min read
Exploring machine learning methods for network optimization challenges.
― 5 min read
This article discusses directed 1-separations and their role in infinite digraphs.
― 4 min read
A look into the properties and applications of extremal families in mathematics.
― 3 min read
An overview of generalized polymorphisms and their role in Boolean function analysis.
― 5 min read
This article examines methods to show certain number sequences are positive.
― 5 min read
Examining the coloring techniques of Cayley graphs in various algebraic structures.
― 5 min read
Analysis of agent interactions and meeting times in non-atomic random walks.
― 5 min read
Explore the complexities of graph sampling and the random cluster model.
― 4 min read
A concise overview of set functions, their types, and optimization methods.
― 5 min read