A bound on judicious bipartitions of directed graphs (Q2303909)
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: A bound on judicious bipartitions of directed graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A bound on judicious bipartitions of directed graphs |
scientific article |
Statements
A bound on judicious bipartitions of directed graphs (English)
0 references
6 March 2020
0 references
directed graph
0 references
partition
0 references
outdegree
0 references
indegree
0 references
tight component
0 references
0 references
0.9310891032218932
0 references
0.9287772178649902
0 references
0.8634452819824219
0 references
0.8629994988441467
0 references
0.840883195400238
0 references
