On the complexity of isoperimetric problems on trees (Q765346)
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: On the complexity of isoperimetric problems on trees |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of isoperimetric problems on trees |
scientific article |
Statements
On the complexity of isoperimetric problems on trees (English)
0 references
19 March 2012
0 references
isoperimetric number
0 references
Cheeger constant
0 references
normalized cut
0 references
graph partitioning
0 references
computational complexity
0 references
approximation algorithms
0 references
weighted trees
0 references
0 references
0 references
0.8521234393119812
0 references
0.8511723875999451
0 references
0.7769713401794434
0 references
0.7689526081085205
0 references
