Results 101 to 110 of about 996,556 (196)
Finding a Maximum Weight Independent Set of a Circle Graph
, 1991 We present an algorithm for finding a maximum weight independent set of a circle graph. For a cicle graph of a set of n chords with N endpoints, the algorithm finds a maximum weight independent set in O(nN) time and O(n) space.Special Section LETTER ...
MUKAIYAMA Akira +2 more
core
A remark on the weak Turan's Theorem [PDF]
Computer Science Journal of Moldova, 2017 A subset $S$ of vertices of a graph $G$ is an \textit{independent set} if no pair of vertices of $S$ are adjacent. The \textit{independence number}, $\alpha(G)$ of $G$, is the maximum cardinality of an independent set of $G$.
Nader Jafari Rad
doaj
Independent component analysis in spiking neurons
, 2010 Although models based on independent component analysis (ICA) have been successful in explaining various properties of sensory coding in the cortex, it remains unclear how networks of spiking neurons using realistic plasticity rules can realize such ...
Cristina Savin +8 more
core +1 more source
Algorithms for Maximum Independent Set Applied to Map Labelling
, 2000 We consider the following map labelling problem: given distinct points p 1, p 2,..., p n in the plane, and given σ, find a maximum cardinality set of pairwise disjoint axis-parallel σ× σ squares Q1, Q2,..., Qr.
Aardal, K.I. +7 more
core
Algorithms for the Maximum Independent Set Problem
, 2015 This thesis focuses mainly on the Maximum Independent Set (MIS) problem. Some related graph theoretical combinatorial problems are also considered. As these problems are generally NP-hard, we study their complexity in hereditary graph classes, i.e. graph
Lê, Ngoc C.
core
ON-LINE MAXIMUM INDEPENDENT SET IN CHORDAL GRAPHS
, 2008 In this paper we deal with the on-line maximum independent set and we propose a probabilistic O(log n)-competitive algorithm for chordal and interval graphs, proving that the same ratio is a lower bound of the problem. The relation of the on-line maximum
George Christodoulou +1 more
core
Improved approximations for maximum independent set via approximation chains
, 1997 We first define the notion of approximation chain and then we use it to obtain, in polynomial time, asymptotic approximation ratio of min{κμ, [κ′ log(logΔ)]Δ} (where κ is a fixed positive constant, κ′ is a constant depending on κ, and Δ, μ are the ...
Paschos, V.Th. +3 more
core +1 more source
From Maximum Cut to Maximum Independent Set
The Maximum Cut (Max-Cut) problem could be naturally expressed either in a Quadratic Unconstrained Binary Optimization (QUBO) formulation, or as an Ising model. It has long been known that the Maximum Independent Set (MIS) problem could also be related to a specific Ising model.
Wu, Chuixiong, Wang, Jianan, Zuo, Fen
openaire +2 more sources
Γ-independent dominating graphs of paths and cycles [PDF]
Songklanakarin Journal of Science and Technology (SJST)A set D of vertices in a graph G is an independent dominating set if D is a set of pairwise nonadjacent vertices of G such that every vertex of G not in D is adjacent to at least one vertex in D.
Roongrat Samanmoo +1 more
doaj
A new heuristic algorithm to solve the maximum independent set problem
, 2013 The Maximum Independent Set Problem is a classic graph optimization NP-hard problem. Given a graph G=(V,E), the independent set problem is that of finding a maximum-cardinality subset S of V such that no two vertices in S are adjacent. In this paper, the
Onur Ugurlu, Ugurlu O.
core +1 more source