Results 21 to 30 of about 13,294,177 (308)
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
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2019 We present the first algorithm for maintaining a maximal independent set (MIS) of a fully dynamic graph---which undergoes both edge insertions and deletions---in polylogarithmic time.
Soheil Behnezhad +4 more
semanticscholar +1 more source
A Maximum Independent Set Method for Scheduling Earth Observing Satellite Constellations [PDF]
Journal of Spacecraft and Rockets, 2020 Operating Earth observing satellites requires efficient planning methods that coordinate activities of multiple spacecraft. The satellite task planning problem entails selecting actions that best satisfy mission objectives for autonomous execution.
Duncan Eddy, Mykel J. Kochenderfer
semanticscholar +1 more source
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
Fair Packing of Independent Sets [PDF]
, 2020 In this work we add a graph theoretical perspective to a classical problem of fairly allocating indivisible items to several agents. Agents have different profit valuations of items and we allow an incompatibility relation between pairs of items described in terms of a conflict graph.
Nina Chiarelli +5 more
openaire +3 more sources
Domination in m− polar soft fuzzy graphs
Ratio Mathematica, 2023 In this paper, we have introduced dominating set, minimal dominating set, independent dominating set, maximal independent dominating set in m − polar soft fuzzy graphs.
S Ramkumar, R Sridevi
doaj +1 more source
Theoretical Computer Science, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Magnús M. Halldórsson +3 more
openaire +1 more source
Eternal Independent Sets in Graphs
Theory and Applications of Graphs, 2016 The use of mobile guards to protect a graph has received much attention in the literature of late in the form of eternal dominating sets, eternal vertex covers and other models of graph protection.
Yair Caro, William Klostermeyer
doaj +1 more source