5889 search results - page 362 / 1178 » Graph Layout Problems |
213
click to vote
SPAA
2004
ACM
16 years 6 days ago
2004
ACM
We consider the problem of partitioning a graph into k components of roughly equal size while minimizing the capacity of the edges between different components of the cut. In part...
168
click to vote
FLAIRS
2003
15 years 8 months ago
2003
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to a set of constraints. While solving a CSP is an ...
180
click to vote
ICMCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We proposed a new foreground detection method using the static cameras. It merges multi-modality into graph cut energy function, and performs much better results than conventional...
172
click to vote
GD
2007
Springer
16 years 29 days ago
2007
Springer
We consider the problem of drawing a set of simple paths along the edges of an embedded underlying graph G = (V, E), so that the total number of crossings among pairs of paths is m...
189
click to vote
GD
1999
Springer
15 years 11 months ago
1999
Springer
The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remaind...