1952 search results - page 49 / 391 » Complete partitions of graphs |
JMLR
2012
12 years 18 days ago
2012
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
ORL
2007
13 years 9 months ago
2007
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...
UAI
2004
13 years 11 months ago
2004
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
ISCAS
2005
IEEE
14 years 3 months ago
2005
IEEE
: Assume that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive integer, called a supply or a demand. Each demand vertex can receive ...
INFOVIS
2000
IEEE
14 years 2 months ago
2000
IEEE
Two tasks in Graph Visualization require partitioning: the assignment of visual attributes and divisive clustering. Often, we would like to assign a color or other visual attribut...