Maximum subgraph problem for 3-regular Knödel graphs and its wirelength (Q6132556)
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: Maximum subgraph problem for 3-regular Knödel graphs and its wirelength |
scientific article; zbMATH DE number 7728679
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum subgraph problem for 3-regular Knödel graphs and its wirelength |
scientific article; zbMATH DE number 7728679 |
Statements
Maximum subgraph problem for 3-regular Knödel graphs and its wirelength (English)
0 references
17 August 2023
0 references
maximum subgraph problem
0 references
edge congestion
0 references
wirelength
0 references
linear arrangement
0 references
knödel graph
0 references
0.87495524
0 references
0.87374794
0 references
0.87200606
0 references
0.87046045
0 references
0.8645758
0 references
0.8642874
0 references
