An exploration of locked polyomino tilings and their significance in grid structures.
― 5 min read
Computer Science - Discrete Mathematics
RSSLatest Articles
Latest Articles
Research reveals new bounds for signed double Roman domination in cubic graphs.
― 7 min read
Investigating the complexities of edge coloring in circle graphs.
― 4 min read
Explore how Fibonacci numbers can represent natural and negative integers.
― 5 min read
This paper examines the size of independent dominating sets in planar triangulations.
― 4 min read
This article discusses Kalai's conjecture and symmetry in polytopes.
― 5 min read
Learn how ideas spread through networks using graph burning concepts.
― 5 min read
Exploring guard strategies in bipartite graphs against attacks.
― 5 min read
A novel method using information theory to identify communities in hypergraphs.
― 7 min read
Learn effective methods for distributing items to prevent overload in systems.
― 6 min read
A study reviewing different formulations for cutting shapes efficiently.
― 7 min read
A new approach enhances the study of complex networks through efficient curvature computation.
― 6 min read
Examining integer sequences using finite automata for quick proofs and insights.
― 5 min read
Proposing six standards for effective graph clustering without distance information.
― 6 min read
A new algorithm simplifies decision-making in online selection problems.
― 4 min read
A model combines deep learning and rule-based systems for clear decision-making.
― 5 min read
Hyperbolic neural networks enhance tree structure representation in data science.
― 6 min read
Examining recent findings in tolerant testing of monotonicity, unateness, and juntas in functions.
― 6 min read
Explore the game dynamics of Cops and Robbers on graph structures.
― 5 min read
A fresh approach for using neural networks with complex data structures.
― 9 min read
Methods to balance task distribution among resources for optimal performance.
― 5 min read
Exploring the significance of optimal leaf roots in evolutionary biology.
― 5 min read
A method for efficiently identifying maximal clique-partitions in graphs.
― 5 min read
This article simplifies a classic algorithm for tree isomorphism using prime numbers.
― 6 min read
Exploring the importance of sparsification in graph analysis and its applications.
― 5 min read
Approaches for fair resource distribution in network flows.
― 4 min read
Exploring methods to efficiently generate De Bruijn sequences for diverse applications.
― 3 min read
This article explores strategies to maintain fresh information in social business networks.
― 4 min read
This article examines methods for creating hypergraphs with specific degree sequences.
― 4 min read
Exploring a new way to tackle the classic three jug puzzle using graph theory.
― 5 min read
A new approach to solve MWIS efficiently in specific graph types.
― 5 min read
A closer look at independent transversals and graph coloring techniques.
― 5 min read
A new approach to string optimization enhances performance in decision-making tasks.
― 6 min read
This article examines the difficulties in enumerating inclusion-wise minimal separators in graph theory.
― 6 min read
A look into hypergraphs, their properties, and applications in various fields.
― 6 min read
An overview of mixed-variable optimization problems and current research advancements.
― 5 min read
Exploring strategies in the Cops and Robbers game with 1-planar graphs.
― 7 min read
This work presents methods for generating trees to model graphs effectively.
― 5 min read
This article studies maximal cliques across various random network models.
― 5 min read
A look at hypergraphs and their significance in analyzing complex connections.
― 6 min read
Exploring methods to improve search efficiency in trees with varying node costs.
― 8 min read