An efficient heuristic procedure for partitioning graphs

Keywords

Heuristic, Graph partition, Graph, Computer science, Mathematical optimization

References

• Computer solutions of the traveling salesman problemShen Lin — 1965
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesisJoseph B. Kruskal — 1964

Cited by

• An Interconnection Network Topology Generation Scheme for Multicore SystemsBharath Phanibhushana — 2013
• Exploratory data analysis using network based techniquesClara Granell Martorell — 2012
• Research Collaboration, Academic Stars and the Evolution of Science SystemsLeonardo Reyes-Gonzalez — 2012
• Global Placement Techniques for VLSI Physical Design AutomationZhen Yang, Shawki Areibi — 2002
• Partitioning State Spaces of Concurrent Transition SystemsMustapha Bourahla — 2005
• Graph-Based Clustering for Computational Linguistics: A SurveyZheng Chen, Heng Ji — 2010
• Design Partitioning for Custom Hardware EmulationNikolaos Mitas — 2011
• Routing and scheduling of vehicles and crews : The state of the artSamuel J. Raff — 1983
• Synthesis and compositional verification using language learningRajeev Alur, Wonhong Nam — 2007
• Etude de la robustesse des graphes sociaux émergents. (Study of the robustness of emerging social graphs)Slimane Lemmouchi — 2012
• Energy-driven Optimization of Hardware and Software for Distributed Embedded SystemsShuvra S. Bhattacharyya, Chung-Ching Shen — 2008
• Environnement Interopérable Distribué pour les Simulations Numériques avec Composants CAPE-OPEN. (Distributed Interoperable Environment for Numerical Simulations using CAPE-OPEN Components)Laurent Pigeon — 2007
• Graph partitioning techniques for Markov Decision Processes decompositionRégis Sabbadin — 2002
• An efficient partition and matching algorithm for query-set-based broadcasting in multiple channel mobile environmentJingfeng Lin, Guangming Wu, Derchian Tsaih — 2009
• Thinking project management in the age of complexity : particular implications on project risk managementLudovic‐Alexandre Vidal — 2009
• Circuit partitioning using high level design informationD. Behrens, Klaus Harbich, Erich Barke — 1996
• Algorithms to Explore the Structure and Evolution of Biological NetworksCarleton L. Kingsford, Saket Navlakha — 2010
• Adaptive multi-constraints in hardware-software partitioning for embedded multiprocessor FPGA systemsTrong‐Yen Lee, Yang‐Hsin Fan, Chia‐Chun Tsai — 2009
• Statistical physics approaches to large-scale socio-economic networksMichael Szell — 2011
• Community detection in networks: Modularity optimization and maximum likelihood are equivalentGladys M. Cormier — 2016

Related papers

• Not so fast, and not so easy: Essentialism doesn't emerge from a simple heuristicNick Braisby — 2014
• Confucian heuristic-teaching method and fostering innovative talentsYan Li — 2008
• Using heuristic worked examples to promote inquiry-based learningYvonne G. Mulder, Ard W. Lazonder, Ton de Jong — 2014
• Group Reassignment for Dynamic Edge PartitioningHe Li, Hang Yuan, Jianbin Huang — 2021
• On the application of scientific research and heuristic model of teaching in higher educationWeihua Wang — 2009
• A Dialogue between East and West: Looking to Socratic Method and Confucius' Heuristic Teaching MethodAimin Chen — 2011
• Ten Points on Heuristic TeachingJiang Tong — 2001
• A New Look at Heuristic Teaching.Jon L. Higgins — 1971