Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey (Q4842704)
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: Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey |
scientific article; zbMATH DE number 786110
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey |
scientific article; zbMATH DE number 786110 |
Statements
Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey (English)
0 references
18 June 1996
0 references
semicomplete multipartite digraph
0 references
extended semicomplete digraphs
0 references
independent set
0 references
semicomplete bipartite digraphs
0 references
survey
0 references
cycles
0 references
paths
0 references
factor
0 references
Hamiltonian
0 references
polynomial algorithm
0 references
Hamiltonian cycle problem
0 references
0 references
0.8430113792419434
0 references
0.8430113792419434
0 references
0.8232240080833435
0 references
0.812381386756897
0 references
