Address De-duplication using Iterative k-Core Graph Decomposition
Abstract
References
Index Terms
- Address De-duplication using Iterative k-Core Graph Decomposition
Recommendations
Balanced decomposition of a vertex-colored graph
A balanced vertex-coloring of a graph G is a function c from V(G) to {-1,0,1} such that @?{c(v):v@?V(G)}=0. A subset U of V(G) is called a balanced set if U induces a connected subgraph and @?{c(v):v@?U}=0. A decomposition V(G)=V"1@?...@?V"r is called a ...
Vertex partition of a complete multipartite graph into two kinds of induced subgraphs
Let k, @? be positive integers. Let G be a graph of order k@?. It is shown that if G is a complete multipartite graph, G has a vertex partition V(G)=V"1@?V"2@?...@?V"@? such that for some pair of graphs H"1 and H"2 of order k, the subgraph of G induced ...
Edge decomposition of complete tripartite graphs
A graph H decomposes a graph G if and only if the edges of G can be partitioned into disjoint subsets each of which induces a graph isomorphic to H. Wilson (in: C.St.J.A. Nash-Williams, J. Sheehan (Eds.), Proceedings of the Fifth British Combinatorial ...
Comments
Information & Contributors
Information
Published In
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Short-paper
- Research
- Refereed limited
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 25Total Downloads
- Downloads (Last 12 months)25
- Downloads (Last 6 weeks)18
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in