Polynomial time algorithms for two classes of subgraph problem (Q3598037)
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: Polynomial time algorithms for two classes of subgraph problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time algorithms for two classes of subgraph problem |
scientific article |
Statements
Polynomial time algorithms for two classes of subgraph problem (English)
0 references
29 January 2009
0 references
polynomial time algorithm
0 references
NP-complete
0 references
graph
0 references
star
0 references
regular graph
0 references
perfect matching
0 references
0.8207761645317078
0 references
0.8015841245651245
0 references
0.7882406115531921
0 references
0.7784106731414795
0 references