Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 276

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile

Open access
Sbihi, Najiba·1980·Discrete Mathematics

Abstract

Un graphe est dit sans etoile si aucun de ses sommets n'est adjacent a trois sommets formant un stable. Les graphes adjoints sont des graphes sans etoile. Le probleme de la recherche d'un stable de cardinalite maximum dans un graphe sans etoile peut donc etre considere comme une generalisation de celui du couplage maximum. L'algorithme presente est une extension de l'algorithme du couplage d'Edmonds. Une chaine augmentante par rapport a un stable maximal S d'un graphe sans etoile G=(X, E) est un sous-graphe de G qui est une chaine dont les sommets appartiennent alternativement a S et a (X-S) et dont les extremites sont insaturees par S (i.e. adjacentes a un seul sommet de S). S est de cardinalite maximum si et seulement s'il n'existe pas de chaine augmentante par rapport a S. Pour detecter une telle chaine, nous utilisons une procedure de marquage des sommets qui necessite deux operations de reduction; l'une d'entre elles, analogue a celle des ''blossom'' d'Edmonds, reduit le graphe par rapport a un cycle impair sans corde, l'autre reduit le graphe par rapport a une clique. Cette procedure est differente de celle de Minty laquelle commence par chercher s'il existe des chaines augmentantes de longueur trois ou cinq et ce par enumeration, et ensuite a construire pour chaque couple de sommets insatures non voisins, un graphe annexe et a y appliquer l'algorithme du couplage d'Edmonds afin de detecter l'existence d'une chaine augmentante joignant les deux sommets insatures choisis [6].

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/0012-365x(90)90287-r

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 4 references

Cited by

See all 276

Metadata

Authors
Sbihi, N.
Venue
Discrete Mathematics
Publisher
Elsevier BV
Published
1980
Volume
29
Issue
1
Pages
53-76
ISSN
0012-365X (ISSN-L)
OpenAlex
W2001258629
Cited by
276
References
4
FWCI
5.06
Type
journal article
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile. https://app.cochat.ai/papers/10.1016/0012-365x(90)90287-r
The paper
Sbihi, N. (1980). Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile. Discrete Mathematics. https://doi.org/10.1016/0012-365x(90)90287-r

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.