Results 21 to 30 of about 10,037,549 (314)
Beeping a maximal independent set [PDF]
Distributed Computing, 2011 arXiv admin note: substantial text overlap with arXiv:1108 ...
Yehuda Afek +5 more
openaire +6 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 +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
Extremal Independent Set Reconfiguration
The Electronic Journal of Combinatorics, 2023 The independent set reconfiguration problem asks whether one can transform one given independent set of a graph into another, by changing vertices one by one in such a way the intermediate sets remain independent. Extremal problems on independent sets are widely studied: for example, it is well known that an $n$-vertex graph has at most $3^{n/3 ...
Bousquet, Nicolas +3 more
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
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
Approximation hardness of dominating set problems in bounded degree graphs [PDF]
, 2008 We study approximation hardness of the Minimum Dominating Set problem and its variants in undirected and directed graphs. Using a similar result obtained by Trevisan for Minimum Set Cover we prove the first explicit approximation lower bounds for various
Chlebikova, Janka +4 more
core +1 more source
Spectral and Spatial Feature Extraction of Electroencephalographic (EEG) Data Using Independent Component Analysis (ICA) [PDF]
, 2017 Purpose of this research is to extract features associated with human brain signal related to electroencephalographic measurements and classification of extracted EEG signals to the relevant the brain region.
Shah, Nasir Ali +11 more
core +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 +4 more sources