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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Learning Maximum Weighted (k+1)-Order Decomposable Graphs by Integer Linear Programming |
scientific article |
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
