Results 31 to 40 of about 13,294,177 (308)
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
Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2019 In the fully dynamic maximal independent set (MIS) problem our goal is to maintain an MIS in a given graph G while edges are inserted and deleted from the graph.
S. Chechik, Tianyi Zhang
semanticscholar +1 more source
Quasi-polynomial time approximation schemes for the Maximum Weight Independent Set Problem in H-free graphs [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2019 In the Maximum Independent Set problem we are asked to find a set of pairwise nonadjacent vertices in a given graph with the maximum possible cardinality.
M. Chudnovsky +3 more
semanticscholar +1 more source
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
Coloring and Guarding Arrangements [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Combinatorics
Prosenjit Bose +6 more
doaj +1 more source
Nearly optimal edge estimation with independent set queries [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2019 We study the problem of estimating the number of edges of an unknown, undirected graph $G=([n],E)$ with access to an independent set oracle. When queried about a subset $S\subseteq [n]$ of vertices the independent set oracle answers whether $S$ is an ...
Xi Chen, Amit Levi, Erik Waingarten
semanticscholar +1 more source
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
Weighted Domination of Independent Sets [PDF]
Graphs and Combinatorics, 2019 The {\em independent domination number} $γ^i(G)$ of a graph $G$ is the maximum, over all independent sets $I$, of the minimal number of vertices needed to dominate $I$. It is known \cite{abz} that in chordal graphs $γ^i$ is equal to $γ$, the ordinary domination number.
Ron Aharoni, Irina Gorelik
openaire +3 more sources
Algorithmic Aspects of Some Variants of Domination in Graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020 A set S ⊆ V is a dominating set in G if for every u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E, i.e., N[S] = V . A dominating set S is an isolate dominating set (IDS) if the induced subgraph G[S] has at least one isolated vertex.
Kumar J. Pavan, Reddy P.Venkata Subba
doaj +1 more source
Fully dynamic maximal independent set with sublinear update time [PDF]
Symposium on the Theory of Computing, 2018 A maximal independent set (MIS) can be maintained in an evolving m-edge graph by simply recomputing it from scratch in O(m) time after each update. But can it be maintained in time sublinear in m in fully dynamic graphs?
Sepehr Assadi +3 more
semanticscholar +1 more source