Algorithme exact pour le problème de l'indépendant faiblement connexe de cardinalité minimum. | Zendy

AI Assistant Blog Pricing

Open Access

Algorithme exact pour le problème de l'indépendant faiblement connexe de cardinalité minimum.

Author(s) -

Fatiha Bendali,

Jean Mailfert,

Djelloul Mameri

Publication year - 2012

Publication title -

hal (le centre pour la communication scientifique directe)

Language(s) - French

Resource type - Conference proceedings

Subject(s) - computer science , humanities , mathematics , philosophy

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom

About

About Careers Publisher Partners Contact Us Get Organisational Trial or Quote

Learn

FAQs Blog Terms of Use Privacy Policy

Download the Zendy App

Download on the

Discover

Explore

Copyright Knowledge E © 2026. All Rights Reserved.