Results 41 to 50 of about 996,556 (196)
Message Passing for Maximum Weight Independent Set [PDF]
IEEE Transactions on Information Theory, 2009 We investigate the use of message-passing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the performance of the classical loopy max-product belief propagation. We show that each fixed point estimate of max-product can be mapped in a natural way to an extreme point of the LP polytope associated ...
Sanghavi, Sujay +2 more
openaire +3 more sources
Graphs with unique maximum independent sets
Discrete Mathematics, 1985 A graph is a unique independence graph if it has a unique independent set of vertices of maximal cardinality. If, moreover, the complement of the set of vertices is also independent, the graph is called a strong unique independence graph. The authors prove the following theorem: A connected graph is a strong unique independence graph if and only if it ...
Glenn Hopkins, William Staton
openaire +1 more source
Relaxed Two-Coloring of Cubic Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We show that any graph of maximum degree at most $3$ has a two-coloring, such that one color-class is an independent set while the other color induces monochromatic components of order at most $189$. On the other hand for any constant $C$ we exhibit a $4$
Robert Berke, Tibor Szabó
doaj +1 more source
Approximation hardness of dominating set problems in bounded degree graphs
, 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
New models and algorithms for RNA pseudoknot order assignment
International Journal of Applied Mathematics and Computer Science, 2020 The pseudoknot is a specific motif of the RNA structure that highly influences the overall shape and stability of a molecule. It occurs when nucleotides of two disjoint single-stranded fragments of the same chain, separated by a helical fragment ...
Zok Tomasz +5 more
doaj +1 more source
QoS-Aware Bandwidth Allocation and Concurrent Scheduling for Terahertz Wireless Backhaul Networks
IEEE Access, 2020 In recent years, with the spectrum resources in low frequency bands becoming increasingly insufficient, the carrier frequency of wireless communication has started its evolution to the Terahertz (THz) frequency band, and meanwhile the THz communication ...
Haiyan Jiang +4 more
doaj +1 more source
Approximating maximum independent sets in uniform hypergraphs [PDF]
, 1998 Reihe Computational Intelligence ...
Hofmeister, Thomas, Lefmann, Hanno
openaire +2 more sources
On the k-Component Independence Number of a Tree
Discrete Dynamics in Nature and Society, 2021 Let G be a graph and k≥1 be an integer. A subset S of vertices in a graph G is called a k-component independent set of G if each component of GS has order at most k.
Shuting Cheng, Baoyindureng Wu
doaj +1 more source
An improvement on the maximum number of ‐dominating independent sets [PDF]
Journal of Graph Theory, 2018 AbstractErdős and Moser raised the question of determining the maximum number of maximal cliques or, equivalently, the maximum number of maximal independent sets in a graph on vertices. Since then there has been a lot of research along these lines.A ‐dominating independent set is an independent set such that every vertex not contained in has at ...
Dániel Gerbner +4 more
openaire +3 more sources
Targeted Branching for the Maximum Independent Set Problem
CoRR, 2021 Finding a maximum independent set is a fundamental NP-hard problem that is used in many real-world applications. Given an unweighted graph, this problem asks for a maximum cardinality set of pairwise non-adjacent vertices. Some of the most successful algorithms for this problem are based on the branch-and-bound or branch-and-reduce paradigms.
Demian Hespe +2 more
openaire +4 more sources