À la recherche du centre exact: Santa Cruz
Page 47
Abstract
No abstract available.
Index Terms
- À la recherche du centre exact: Santa Cruz
Recommendations
Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile
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 ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
January 1997
304 pages
Copyright © 1997 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 January 1997
Check for updates
Qualifiers
- Article
Conference
SIGGRAPH97
Sponsor:
SIGGRAPH97: The 24th International Conference on Computer Graphics and Interactive Techniques
August 3 - 8, 1997
California, Los Angeles, USA
Acceptance Rates
Overall Acceptance Rate 1,822 of 8,601 submissions, 21%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 115Total Downloads
- Downloads (Last 12 months)10
- Downloads (Last 6 weeks)0
Reflects downloads up to 13 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in