Results 91 to 100 of about 996,556 (196)
Maximum genus and maximum nonseparating independent set of a 3-regular graph
, 1997 A set J ⊆ V is called a nonseparating independent set (nsis) of a connected graph G = (V, E), if J is an independent set of G, i.e., E ∩ {uv | ∀u, v ∈ J} = 0, and G − J is connected. We call z(G) = maxJ{|J||J is an nsis of G} the nsis number of G.
Huang, Yuangqiu, Liu, Yanpei
core +1 more source
On maximum independent sets in \(P_{5}\)-free graphs
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bert Randerath, Ingo Schiermeyer
openaire +1 more source
Using Critical Sets for the Maximum Independent Set Problem Solving
, 2008 The problem of finding a maximum independent set in an undirected graph is a well known NP-hard problem. On the other hand, the critical independent set problem is polynomially solvable. The relationship between these two problems is studied and a method
Svyatoslav Trukhanov, Sergiy Butenko
core
Maximum Independent Set of a Permutation Graph in K Tracks
, 2014 A maximum weighted independent set of a permutation graph is a maximum subset of noncrossing chords in a matching diagram (i.e., a set \Phi of chords with end-points on two horizontal lines).
M.Sarrafzadeh, D.T.Lee
core +1 more source
Quantum Hamiltonian algorithms for maximum independent sets
National Science ReviewABSTRACT We compare two quantum Hamiltonian algorithms that address the maximum independent set problem: one based on the emergent non-Abelian gauge matrix in adiabatic evolution of an energetically isolated manifold of states; the other based on designed application of single-qubit operations. We demonstrate that they are mathematically
Xianjue Zhao +5 more
openaire +4 more sources
Maximum independent sets near the upper bound [PDF]
Discrete Applied Mathematics, 2019 The size of a largest independent set of vertices in a given graph $G$ is denoted by $α(G)$ and is called its independence number (or stability number). Given a graph $G$ and an integer $K,$ it is NP-complete to decide whether $α(G) \geq K.$ An upper bound for the independence number $α(G)$ of a given graph $G$ with $n$ vertices and $m $ edges is given
openaire +2 more sources
Surface- Based Computing Model of Maximum Independent Set Problem
, 2011 About thirty years ago, the concept of the complexity of the problem was proposed. The most important complex class is P and NP class. Fruitful results of this concept are the existence of the so-called complex class complete problem. If the other issues
Zhi Xiang Yin, Yan Yang
core +1 more source
A Characterization of Trees for a New Lower Bound on the K-Independence Number
Discussiones Mathematicae Graph Theory, 2013 Let k be a positive integer and G = (V,E) a graph of order n. A subset S of V is a k-independent set of G if the maximum degree of the subgraph induced by the vertices of S is less or equal to k − 1. The maximum cardinality of a k-independent set of G is
Meddah Nacéra, Blidia Mostafa
doaj +1 more source
Boosting Local Search for the Maximum Independent Set Problem
, 2016 An independent set of a graph G = (V, E) with vertices V and edges E is a subset S ⊆ V, such that the subgraph induced by S does not contain any edges. The goal of the maximum independent set problem (MIS problem) is to find an independent set of maximum
Jakob Dahlum, Dahlum, Jakob
core +1 more source
On hitting all maximum cliques with an independent set [PDF]
Journal of Graph Theory, 2010 We prove that every graph $G$ for which $ω(G) \geq 3/4(Δ(G) + 1)$, has an independent set $I$ such that $ω(G - I) < ω(G)$. It follows that a minimum counterexample $G$ to Reed's conjecture satisfies $ω(G) < 3/4(Δ(G) + 1)$ and hence also $χ(G) > \lceil 7/6ω(G) \rceil$.
openaire +3 more sources