Algorithms for maximum independent set in convex bipartite graphs (Q1017904)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms for maximum independent set in convex bipartite graphs |
scientific article; zbMATH DE number 5553459
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for maximum independent set in convex bipartite graphs |
scientific article; zbMATH DE number 5553459 |
Statements
Algorithms for maximum independent set in convex bipartite graphs (English)
0 references
13 May 2009
0 references
convex bipartite graphs
0 references
independent sets
0 references
BSP/CGM algorithms
0 references
parallel algorithm
0 references
0 references
0.9156640768051147
0 references
0.914238452911377
0 references
0.838214635848999
0 references
0.8283023834228516
0 references
