Results 21 to 30 of about 983,866 (300)
Stability for Maximal Independent Sets [PDF]
The Electronic Journal of Combinatorics, 2020 Answering questions of Y. Rabinovich, we prove "stability" versions of upper bounds on maximal independent set counts in graphs under various restrictions. Roughly these say that being close to the maximum implies existence of a large induced matching or triangle matching (depending on assumptions).
Jeff Kahn 0001, Jinyoung Park 0002
openaire +3 more sources
Independent resolving sets in graphs
AKCE International Journal of Graphs and Combinatorics, 2021 Let be a connected graph. Let be a subset of V with an order imposed on W. The k-vector is called the resolving vector of v with respect to W. The set W is called a resolving set if for any two distinct vertices In this paper we investigate the existence
B. Suganya, S. Arumugam
doaj +1 more source
Eternal domination and clique covering
Electronic Journal of Graph Theory and Applications, 2022 We study the relationship between the eternal domination number of a graph and its clique cove-ring number using both large-scale computation and analytic methods. In doing so, we answer two open questions of Klostermeyer and Mynhardt.
Gary MacGillivray +2 more
doaj +1 more source
Counting Independent Sets in Hypergraphs [PDF]
Combinatorics, Probability and Computing, 2014 Let G be a triangle-free graph with n vertices and average degree t. We show that G contains at least ${\exp\biggl({1-n^{-1/12})\frac{1}{2}\frac{n}{t}\ln t} \biggl(\frac{1}{2}\ln t-1\biggr)\biggr)}$ independent sets. This improves a recent result of the first and third authors [8]. In particular, it implies that as n → ∞, every triangle-free graph on n
Jeff Cooper, Kunal Dutta, Dhruv Mubayi
openaire +4 more sources
Beeping a maximal independent set [PDF]
Distributed Computing, 2011 arXiv admin note: substantial text overlap with arXiv:1108 ...
Yehuda Afek +5 more
openaire +4 more sources
Online Dominating Set and Independent Set
CoRR, 2021 Finding minimum dominating set and maximum independent set for graphs in the classical online setup are notorious due to their disastrous $Ω(n)$ lower bound of the competitive ratio that even holds for interval graphs, where $n$ is the number of vertices.
Minati De +2 more
openaire +2 more sources
Recoverable Values for Independent Sets [PDF]
Random Structures & Algorithms, 2011 AbstractThe notion of recoverable value was advocated in the work of Feige, Immorlica, Mirrokni and Nazerzadeh (APPROX 2009) as a measure of quality for approximation algorithms. There, this concept was applied to facility location problems. In the current work we apply a similar framework to the maximum independent set problem (MIS).
Uriel Feige, Daniel Reichman 0001
openaire +2 more sources
Maximum independent sets [PDF]
, 2023 Several datasets containing a numerical study done to compare three different algorithms. Aim of the study was to see which algorithms output the largest maximal independent sets.
Niek Mooij (16891710)
core +1 more source
Enumeration of Permutation Classes and Weighted Labelled Independent Sets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 In this paper, we study the staircase encoding of permutations, which maps a permutation to a staircase grid with cells filled with permutations. We consider many cases, where restricted to a permutation class, the staircase encoding becomes a bijection ...
Christian Bean +2 more
doaj +1 more source
On the Periodic Structure of Parallel Dynamical Systems on Generalized Independent Boolean Functions
Mathematics, 2020 In this paper, based on previous results on AND-OR parallel dynamical systems over directed graphs, we give a more general pattern of local functions that also provides fixed point systems.
Juan A. Aledo +4 more
doaj +1 more source