Graph clustering (Q458448): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cosrev.2007.05.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W143174683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering large graphs via the singular value decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander flows, geometric embeddings and graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of finding dense subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Allocate Network Centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4037431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4950474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering Using Objective Functions and Stochastic Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm for betweenness centrality* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4450810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub Location and the <i>p</i>-Hub Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering to minimize the sum of cluster diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5614192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4817759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for the Uncapacitated Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random walks and local cuts in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Spectra of Random Graphs with Given Expected Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral bounds for the betweenness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3351135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signless Laplacians and line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring networks with traceroute-like probes: Theory and simulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Old and new results on algebraic connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting network communities: a new systematic and efficient algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchical clustering algorithm based on fuzzy graph connectedness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3706275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2707395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation of the Minimum Bisection / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dense \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding optimal solutions to the graph partitioning problem with heuristic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3877805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Clustering and Minimum Cut Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal Flow Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NEW CLUSTERING MODEL OF WIRELESS SENSOR NETWORKS USING FACILITY LOCATION THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Parametric Maximum Flow Algorithm and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fuzzy clustering for the estimation of the parameters of the components of mixtures of normal distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community structure in social and biological networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to the maximum-flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering to minimize the maximum intercluster distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Quality of Spectral Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: The worldwide air transportation network: Anomalous centrality, community structure, and cities' global roles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm AS 136: A K-Means Clustering Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A clustering algorithm based on graph connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Web document clustering using hyperlink structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral clustering and its use in bioinformatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4720078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy and hard bottleneck location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-cut clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4372784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a unified territorial design approach - applications, algorithms and GIS integration. (With comments and rejoinder) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clusterings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decentralized algorithm for spectral analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Capacitated <i>K</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in projection and clustering by simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the p-hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hard problems in hierarchical-tree clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: How the science of complex networks can help developing strategies against terrorism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3101597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accuracy of computed eigenvectors via optimizing a Rayleigh quotient / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the triangle inequality for the Tanimoto distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4878667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808930 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4450804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying molecular sequences using a linkage graph with their pairwise similarities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsest cuts and bottlenecks in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3157878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Structure and Function of Complex Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5395264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A clustering approach to the planar hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the p-center problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Sparse Matrices with Eigenvectors of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of the Stability Characteristics of Some Graph Theoretic Clustering Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine Learning: ECML 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster graph modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2006: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3033325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral partitioning works: planar graphs and finite element meshes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On weakly cospectral graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which graphs are determined by their spectrum? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3045823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast online graph clustering via Erdős-Rényi mixture / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/1532443041827943 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sales Territory Alignment: A Review and Model / rank
 
Normal rank

Latest revision as of 02:37, 9 July 2024

scientific article
Language Label Description Also known as
English
Graph clustering
scientific article

    Statements

    Graph clustering (English)
    0 references
    7 October 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references