![]() |
Volumn 105, Issue 2-3, 2006, Pages 329-344
|
A linear programming formulation for the maximum complete multipartite subgraph problem
|
Author keywords
Complete multipartite subgraph; Independence system; Integer linear programming
|
Indexed keywords
GRAPH THEORY;
POLYNOMIALS;
PROBLEM SOLVING;
SET THEORY;
COMPLETE MULTIPARTITE SUBGRAPH;
INDEPENDENCE SYSTEM;
INTEGER LINEAR PROGRAMMING;
MATHEMATICAL PROGRAMMING;
|
EID: 29044442522
PISSN: 00255610
EISSN: 14364646
Source Type: Journal
DOI: 10.1007/s10107-005-0656-6 Document Type: Conference Paper |
Times cited : (3)
|
References (11)
|