Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Illya V. Hicks"'
Publikováno v:
Mathematical Programming.
We introduce techniques to build small ideal mixed-integer programming (MIP) formulations of combinatorial disjunctive constraints (CDCs) via the independent branching scheme. We present a novel pairwise IB-representable class of CDCs, CDCs admitting
Autor:
Derek Mikesell, Illya V. Hicks
Publikováno v:
Networks. 80:93-108
Autor:
Logan A. Smith, Illya V. Hicks
Publikováno v:
Networks. 79:202-219
Publikováno v:
Networks. 79:3-19
We present an integer programming model to compute the strong rainbow connection number, $src(G)$, of any simple graph $G$. We introduce several enhancements to the proposed model, including a fast heuristic, and a variable elimination scheme. Moreov
Autor:
Bochuan Lyu, Illya V. Hicks
The biclique partition number $(\text{bp})$ of a graph $G$ is referred to as the least number of complete bipartite (biclique) subgraphs that are required to cover the edges of the graph exactly once. In this paper, we show that the biclique partitio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::824842749d98e0b04c8cf07ef4e041ea
http://arxiv.org/abs/2203.02837
http://arxiv.org/abs/2203.02837
Autor:
Boris Brimkov, Illya V. Hicks
Publikováno v:
Networks. 77:161-172
Publikováno v:
Networks. 76:366-380
Autor:
Illya V. Hicks, Boris Brimkov, Louis Deaett, Ruth Haas, Derek Mikesell, David Roberson, Logan Smith
Publikováno v:
Hicks, I, Brimkov, B, Deaett, L, Haas, R, Mikesell, D, Roberson, D & Smith, L 2022, ' Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph ', INFORMS Journal on Computing, vol. 34, no. 6, pp. 2867-3350 . https://doi.org/10.1287/ijoc.2022.1219
The minimum rank of a graph G is the minimum of the ranks of all symmetric adjacency matrices of G. We present a new combinatorial bound for the minimum rank of an arbitrary graph G based on enumerating certain subsets of vertices of G satisfying mat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a619c1175a489ecafbd56f62ac6b79aa
https://orbit.dtu.dk/en/publications/ca7c57b2-00b1-44a2-acef-dfa5f9cfdaab
https://orbit.dtu.dk/en/publications/ca7c57b2-00b1-44a2-acef-dfa5f9cfdaab
Publikováno v:
Theoretical Computer Science. 795:142-153
A power dominating set of a graph $G=(V,E)$ is a set $S\subset V$ that colors every vertex of $G$ according to the following rules: in the first timestep, every vertex in $N[S]$ becomes colored; in each subsequent timestep, every vertex which is the
Autor:
Caleb C. Fast, Illya V. Hicks
Publikováno v:
Discrete Applied Mathematics. 250:215-226
In this paper, we present new bounds on the zero-forcing propagation time and zero-forcing number. Zero-forcing is based on iterating the following color change rule. If a vertex is colored and has only one neighbor that is not colored, then that unc