Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F02%3A00073311" target="_blank" >RIV/49777513:23520/02:00073311 - isvavai.cz</a>

Alternative codes found

RIV/49777513:23520/02:00000408

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set

Original language description

The well-known greedy algorithm MIN for finding a maximal independent set in a graph Gis based on recursively removing the closed neighborhood of a vertex which has (in the currently existing graph) minimum degree. We give a forbidden induced subgraph condition under which algorithm MIN always results in finding a maximum independent set of G, and hence yields the exact value of the independence number of G in polynomial time.

Czech name

—

Czech description

—

Type

J_x - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

CEP classification

BA - General mathematics

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2002

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Discrete Mathematics

ISSN

0012365X

e-ISSN

—

Volume of the periodical

Vol. 256

Issue of the periodical within the volume

leden

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

9

Pages from-to

193

UT code for WoS article

—

EID of the result in the Scopus database

—