Results 281 to 290 of about 13,294,177 (308)

Algorithms for maximum independent sets

Journal of Algorithms, 1986
Summary: An algorithm is presented which finds (the size of) a maximum independent set of an n vertex graph in time \(O(2^{0.276n})\) improving on a previous bound of \(O(2^{n/3})\). The improvement comes principally from three sources: first, a modified recursive algorithm based on a more detailed study of the possible subgraphs around a chosen vertex:
openaire   +2 more sources

Approximations of independent sets in graphs

1998
The independent set problem is that of finding a maximum size set of mutually non-adjacent vertices in a graph. The study of independent sets, and their alter egos, cliques, has had a central place in combinatorial theory. The current paper is not meant to be the ultimate summary of independent set approximation algorithms, but an introduction to the ...
openaire   +1 more source

Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling

SIGMOD Conference, 2017
Lijun Chang, Wei Li, W. Zhang
semanticscholar   +1 more source

A hybrid iterated local search heuristic for the maximum weight independent set problem

Optimization Letters, 2017
B. Nogueira, Rian G. S. Pinheiro, A. Subramanian   +2 more
semanticscholar   +1 more source

How valuable are independent directors? Evidence from external distractions

Journal of Financial Economics, 2019
Ronald W Masulis
exaly  

Independent domination in graphs: A survey and recent results

Discrete Mathematics, 2013
Michael Henning, Wayne Goddard
exaly  

Independent component analysis: algorithms and applications

Neural Networks, 2000
Aapo Johannes Hyvarinen, Erkki Oja
exaly  

Two Tight Independent Set Conditions for Fractional (g, f, m)-Deleted Graphs Systems

Qualitative Theory of Dynamical Systems, 2017
Wei Gao, J. L. Guirao, Hualong Wu
semanticscholar   +1 more source

Hiring Cheerleaders: Board Appointments of “Independent” Directors

Management Science, 2012
Lauren Cohen, Andrea Frazzini, Christopher Malloy   +2 more
exaly  

On generating all maximal independent sets

Information Processing Letters, 1988
David S Johnson, Christos H Papadimitriou   +1 more
exaly