Determining the number of internal stability of a graph

DOI10.1080/00207168208803311zbMath0496.05057OpenAlexW2041210844MaRDI QIDQ3960887

Emmanuel Loukakis, Constantine Tsouros

Publication date: 1982

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168208803311

zbMATH Keywords

independence numberNP-hardtree search algorithminternal stability number

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (05C99) Algorithms in computer science (68W99)

Related Items (14)

A multi-KP modeling for the maximum-clique problem ⋮ An algorithm for the maximum internally stable set in a weighted graph ⋮ Solving the maximum clique problem using a tabu search approach ⋮ A global optimization approach for solving the maximum clique problem ⋮ An algorithm for finding a maximum weighted independent set in an arbitrary graph ⋮ An exact algorithm for the maximum clique problem ⋮ A branch and bound algorithm for the maximum clique problem ⋮ A branch-and-cut algorithm for the pallet loading problem ⋮ Using Fifth Generation Tools for Solving the Clique Number Problem ⋮ TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph ⋮ An exact algorithm for the pallet loading problem ⋮ GEODETIC GAMES FOR GRAPHS ⋮ Finding maximum cliques in arbitrary and in special graphs ⋮ The maximum clique problem

Cites Work

• Unnamed Item
• Unnamed Item
• On maximal independent sets of vertices in claw-free graphs
• Maximum internally stable sets of a graph
• Anti-blocking polyhedra
• Minimum node covers and 2-bicritical graphs
• Covers and packings in a family of sets
• A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
• Vertex packings: Structural properties and algorithms
• Finding a Maximum Independent Set
• On the integer-valued variables in the linear vertex packing problem
• Determining the Stability Number of a Graph
• On the facial structure of set packing polyhedra

This page was built for publication: Determining the number of internal stability of a graph