2487 search results - page 62 / 498 » Partitions of Graphs into Trees |
ISCAS
1994
IEEE
14 years 1 months ago
1994
IEEE
In layout design nding e ciently good solutions to the hypergraph bipartitioning problem is of great importance. This paper introduces a new algorithm, the dynamic locking algorit...
ICTAI
2006
IEEE
14 years 3 months ago
2006
IEEE
This paper describes a new bipartite formulation for word-document co-clustering such that hyperclique patterns, strongly affiliated documents in this case, are guaranteed not to ...
ICML
2005
IEEE
14 years 10 months ago
2005
IEEE
We present a new subgoal-based method for automatically creating useful skills in reinforcement learning. Our method identifies subgoals by partitioning local state transition gra...
CSR
2009
Springer
14 years 3 months ago
2009
Springer
The 2-Disjoint Connected Subgraphs problem asks if a given graph has two vertex-disjoint connected subgraphs containing prespecified sets of vertices. We show that this problem is...
CCCG
2010
13 years 10 months ago
2010
We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the follo...