A generalization of maximal independent sets

DOI10.1016/S0166-218X(00)00215-8zbMath0976.68117MaRDI QIDQ5931790

Ľubomír Šoltés, Giri Narasimhan, Arun K. Jagota

Publication date: 6 May 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

\(k\)-insulated setHopfield network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Constrained public goods in weighted networks with heterogeneous agents ⋮ The \textsc{max quasi-independent set} problem ⋮ The insulation sequence of a graph ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey

Cites Work

• Approximating the minimum maximal independence number
• The node-deletion problem for hereditary properties is NP-complete
• Amortized Computational Complexity
• Finding a Maximum Clique in an Arbitrary Graph
• Cliques in random graphs
• Interactive proofs and the hardness of approximating cliques
• The approximation of maximum subgraph problems
• Approximating maximum independent sets by excluding subgraphs
• Neural networks and physical systems with emergent collective computational abilities.
• An Analysis of Some Graph Theoretical Cluster Techniques
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item