max_independent_set
Finds a graph's maximum independent set for up to 20 vertices using exact bitmask enumeration, helping solve selection problems where no two chosen vertices are adjacent.
Instructions
Find the maximum independent set of a graph using exact bitmask enumeration (up to 20 vertices).
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"vertex_count": "<vertex_count>",
"edges": "<edges>"
},
"name": "max_independent_set"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| edges | Yes | Edges as [u, v] pairs | |
| vertex_count | Yes | Number of vertices (max 20) |