Enumerating the min-cuts for applications to graph extraction under size constraints.
Kengo R. AzegamiAtsushi TakahashiY. KajitanPublished in: ISCAS (6) (1999)
Keyphrases
- min cut
- random walk
- constraint satisfaction
- graph theory
- graph structure
- maximum clique
- information extraction
- image segmentation
- cover inequalities
- planar graphs
- maximal cliques
- graph representation
- undirected graph
- constrained optimization
- directed acyclic graph
- memory requirements
- connected components
- geometric constraints
- graph model
- automatic extraction
- constraint programming
- graph data
- global consistency
- directed graph
- knn
- optimal solution
- search engine