Learning maximum weighted \((k+1)\)-order decomposable graphs by integer linear programming (Q2938422)
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: Learning maximum weighted (k+1)-order decomposable graphs by integer linear programming |
scientific article; zbMATH DE number 6386476
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Learning maximum weighted \((k+1)\)-order decomposable graphs by integer linear programming |
scientific article; zbMATH DE number 6386476 |
Statements
Learning Maximum Weighted (k+1)-Order Decomposable Graphs by Integer Linear Programming (English)
0 references
14 January 2015
0 references
maximum weighted graph problem
0 references
decomposable graph
0 references
bounded clique size
0 references
integer linear programming
0 references
0.7800919413566589
0 references
0.7670887112617493
0 references
0.7543790340423584
0 references
0.740692138671875
0 references
