Results 21 to 30 of about 2,644,664 (312)
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
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
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
Combinatorics, Probability and Computing, 2012 The study of extremal problems related to independent sets in hypergraphs is a problem that has generated much interest. There are a variety of types of independent sets in hypergraphs depending on the number of vertices from an independent set allowed in an edge.
Cutler, Jonathan, Radcliffe, A. J.
openaire +3 more sources
Independent sets of maximum weight in apple-free graphs [PDF]
, 2010 We present the first polynomial-time algorithm to solve the maximum weight independent set problem for apple-free graphs, which is a common generalization of several important classes where the problem can be solved efficiently, such as claw-free graphs,
Lozin, Vadim V. +2 more
core +1 more source
ISDC Reflections on Emerging One CGIAR Research Portfolio and Investment Plan [PDF]
, 2021 The Executive Management Team (EMT) requested the Independent Science for Development Council (ISDC) to comment on the preliminary set of Research Initiatives.
CGIAR Independent Science for Development Council
core
Discrete Applied Mathematics, 2016 The regular independence number, introduced by Albertson and Boutin in 1990, is the size of a largest set of independent vertices with the same degree. Lower bounds were proven for this invariant, in terms of the order, for trees and planar graphs.
Yair Caro, Adriana Hansberg, Ryan Pepper
openaire +3 more sources
Independent Sets in Polarity Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2016 Given a projective plane $Σ$ and a polarity $θ$ of $Σ$, the corresponding polarity graph is the graph whose vertices are the points of $Σ$, and two distinct points $p_1$ and $p_2$ are adjacent if $p_1$ is incident to $p_2^{ θ}$ in $Σ$. A well-known example of a polarity graph is the Erdős-Rényi orthogonal polarity graph $ER_q$, which appears frequently
Michael Tait, Craig Timmons
openaire +3 more sources