Results 311 to 320 of about 1,606,531 (352)
Some of the next articles are maybe not open access.
Incomplete Multi-View Clustering With Joint Partition and Graph Learning
IEEE Transactions on Knowledge and Data Engineering, 2021Incomplete multi-view clustering (IMC) aims to integrate the complementary information from incomplete views to improve clustering performance. Most existing IMC methods try to fill the incomplete views or directly learn a common representation based on ...
Lusi Li, Zhiqiang Wan, Haibo He
semanticscholar +1 more source
Initialization for Network Embedding: A Graph Partition Approach
Web Search and Data Mining, 2019Network embedding has been intensively studied in the literature and widely used in various applications, such as link prediction and node classification.
Wenqing Lin +4 more
semanticscholar +1 more source
Combinatorics, Probability and Computing, 1996
In this paper, we prove that every graph contains a cycle intersecting all maximum independent sets. Using this, we further prove that every graph with stability number α is spanned by α disjoint cycles. Here, the empty set, the graph of order 1 and the path of order 2 are all considered as degenerate cycles.
Chen, C.C., Jin, G.P.
openaire +2 more sources
In this paper, we prove that every graph contains a cycle intersecting all maximum independent sets. Using this, we further prove that every graph with stability number α is spanned by α disjoint cycles. Here, the empty set, the graph of order 1 and the path of order 2 are all considered as degenerate cycles.
Chen, C.C., Jin, G.P.
openaire +2 more sources
A graph partition problem [PDF]
Acta Mathematicae Applicatae Sinica, 1996 Let \(G= (V,E)\) be a graph, and \(e_1\), \(e_2\) disjoint edges of \(G\). Suppose that \(E-\{e_1,e_2\}\) can be partitioned into sets \(E_1\) and \(E_2\), where \(G_i\) is the subgraph spanned by \(E_i\), \(i=1,2\). Also suppose that \(G_1\) has each of its components unicyclic and \(G_2\) has exactly four components that are trees, each one incident ...
Simeone Bruno +2 more
openaire +2 more sources
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, 2004
In this paper we consider the problem of (k, υ)-balanced graph partitioning - dividing the vertices of a graph into k almost equal size components (each of size less than υ • nk) so that the capacity of edges between different components is minimized. This problem is a natural generalization of several other problems such as minimum bisection, which is
Harald Räcke, Konstantin Andreev
openaire +2 more sources
In this paper we consider the problem of (k, υ)-balanced graph partitioning - dividing the vertices of a graph into k almost equal size components (each of size less than υ • nk) so that the capacity of edges between different components is minimized. This problem is a natural generalization of several other problems such as minimum bisection, which is
Harald Räcke, Konstantin Andreev
openaire +2 more sources
Mathematical Methods of Operations Research (ZOR), 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
William W. Hager, Yaroslav Krylyuk
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
William W. Hager, Yaroslav Krylyuk
openaire +3 more sources
Journal of Graph Theory, 1997
Packing by induced stars is characterised.
Yoshimi Egawa +2 more
openaire +3 more sources
Packing by induced stars is characterised.
Yoshimi Egawa +2 more
openaire +3 more sources
Incomplete Multiview Spectral Clustering With Adaptive Graph Learning
IEEE Transactions on Cybernetics, 2020In this paper, we propose a general framework for incomplete multiview clustering. The proposed method is the first work that exploits the graph learning and spectral clustering techniques to learn the common representation for incomplete multiview ...
Jie Wen, Yong Xu, Hong Liu
semanticscholar +1 more source
The partition dimension of a graph
Aequationes Mathematicae, 2000An ordered partition of the vertices of a graph \(G\) is resolving if all vertices have distinct vectors of distances to the partition classes. The partition dimension pd\((G)\) of \(G\) is the smallest size of a resolving partition. This turns out to be at most 1 more than the metric dimension, obtained similarly, after substituting partitions by ...
Ebrahim Salehi +2 more
openaire +2 more sources
SIAM Journal on Computing, 1992
The graph partitioning problem is the problem of dividing a given graph of \(n\) nodes into two sets of prescribed size while cutting a minimum number of edges. The authors show that the partitioning problem of a planar graph can be solved in polynomial time if the cutsize of the optimal partition is \(O(\log n)\) or if an embedding of the graph is ...
Thang Nguyen Bui, Andrew Wynne Peck
openaire +3 more sources
The graph partitioning problem is the problem of dividing a given graph of \(n\) nodes into two sets of prescribed size while cutting a minimum number of edges. The authors show that the partitioning problem of a planar graph can be solved in polynomial time if the cutsize of the optimal partition is \(O(\log n)\) or if an embedding of the graph is ...
Thang Nguyen Bui, Andrew Wynne Peck
openaire +3 more sources