Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.28599

Algorithms for the Maximum Edge Open Packing Problem

Sriram Bhyravarapu·Gautam K. Das·Kamal Santra
View original source ↗Read source document ↗Export metadata ↓

Abstract

Packing problems form a central theme in graph theory, owing to their relevance in modeling conflict-free resource allocation, network design, and communication constraints. Motivated by applications in wireless networks where each device can participate in at most one communication at a time and simultaneous links must avoid interference we consider a generalization of induced matching known as \emph{edge open packing}. Two edges of a graph are said to conflict if a third edge connects one endpoint of each; an \emph{edge open packing set} is a set of edges containing no such conflicting pair. The largest cardinality of such a set is the \emph{edge open packing number} of a graph. In this work, we study the computational complexity of the Maximum Edge Open Packing Problem. We give a polynomial-time algorithm for the problem in \emph{distance-hereditary graphs}, exploiting their canonical decomposition via twin-set interactions. We further show that the problem remains polynomial-time solvable on \emph{biconvex bipartite graphs}, thereby identifying a tractable subclass within bipartite graphs, in contrast to the known NP-hardness of the problem on Eulerian bipartite graphs. Finally, we initiate the parameterized complexity study of the problem and present a fixed-parameter tractable algorithm for \emph{chordal graphs}, parameterized by the clique number $ω$, running in $O(2^ω\cdot\mathrm{poly}(n))$ time.

Explore related subjects

math.COcs.DM

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sriram Bhyravarapu, Gautam K. Das, Kamal Santra. 2026-06-26. Algorithms for the Maximum Edge Open Packing Problem. https://arxiv.org/abs/2606.28599

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗