Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms (Q3522965)
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: Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms |
scientific article; zbMATH DE number 5321111
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms |
scientific article; zbMATH DE number 5321111 |
Statements
Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms (English)
0 references
4 September 2008
0 references
0.9160864353179932
0 references
0.7918342351913452
0 references
0.7755552530288696
0 references