Relabelling vertices according to the network structure by minimizing the cyclic bandwidth sum
暂无分享,去创建一个
Céline Robardet | Patrick Flandrin | Pierre Borgnat | Ronan Hamon | P. Flandrin | P. Borgnat | C. Robardet | Ronan Hamon
[1] P. Jaccard,et al. Etude comparative de la distribution florale dans une portion des Alpes et des Jura , 1901 .
[2] José M. F. Moura,et al. Discrete Signal Processing on Graphs: Frequency Analysis , 2013, IEEE Transactions on Signal Processing.
[3] Lin Yixun,et al. THE CYCLIC BANDWIDTH PROBLEM , 1994 .
[4] Jean-Loup Guillaume,et al. Towards multi-ego-centred communities: a node similarity approach , 2013, Int. J. Web Based Communities.
[5] Jin-Kao Hao,et al. An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem , 2008, Comput. Oper. Res..
[6] Pierre Borgnat,et al. Transformation de graphes dynamiques en signaux non stationnaires , 2013 .
[7] Gursaran,et al. General variable neighbourhood search for cyclic bandwidth sum minimization problem , 2012, 2012 Students Conference on Engineering and Systems.
[8] Céline Robardet,et al. Discovering the structure of complex networks: Implementation and Complexity of the heuristic MACH , 2015 .
[9] José Torres-Jiménez,et al. Memetic Algorithms for the MinLA Problem , 2005, Artificial Evolution.
[10] Santo Fortunato,et al. Community detection in graphs , 2009, ArXiv.
[11] Ciro Cattuto,et al. High-Resolution Measurements of Face-to-Face Contact Patterns in a Primary School , 2011, PloS one.
[12] JOSEP DÍAZ,et al. A survey of graph layout problems , 2002, CSUR.
[13] Céline Robardet,et al. Networks as signals, with an application to a bike sharing system , 2013, 2013 IEEE Global Conference on Signal and Information Processing.
[14] Patrick Flandrin,et al. Tracking of a dynamic graph using a signal theory approach : application to the study of a bike sharing system , 2013 .
[15] L. Amaral,et al. Duality between Time Series and Networks , 2011, PloS one.
[16] P. Groenen,et al. Modern multidimensional scaling , 1996 .
[17] Pascal Frossard,et al. The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains , 2012, IEEE Signal Processing Magazine.
[18] Mark Newman,et al. Networks: An Introduction , 2010 .
[19] Dharna Satsangi. DESIGN AND DEVELOPMENT OF METAHEURISTIC TECHNIQUES FOR SOME GRAPH LAYOUT PROBLEMS , 2013 .
[20] Hao Jianxiu. Cyclic bandwidth sum of graphs , 2001 .
[21] Michael Small,et al. Time-series analysis of networks: exploring the structure with random walks. , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.
[22] Pierre Borgnat,et al. Graph Wavelets for Multiscale Community Mining , 2014, IEEE Transactions on Signal Processing.
[23] Takaomi Shigehara,et al. From networks to time series. , 2012, Physical review letters.
[24] S Koilraj,et al. Labelings of graphs , 2008 .
[25] Francisco Gortázar,et al. A hybrid metaheuristic for the cyclic antibandwidth problem , 2013, Knowl. Based Syst..
[26] Soummya Kar,et al. Consensus + innovations distributed inference over networks: cooperation and sensing in networked systems , 2013, IEEE Signal Processing Magazine.
[27] C. Guestrin,et al. Distributed regression: an efficient framework for modeling sensor network data , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.
[28] Gabriel Ramírez-Torres,et al. A New Branch and Bound Algorithm for the Cyclic Bandwidth Problem , 2012, MICAI.
[29] Reuven Bar-Yehuda,et al. Computing an Optimal Orientation of a Balanced Decomposition Tree for Linear Arrangement Problems , 2001, J. Graph Algorithms Appl..
[30] Marc Moonen,et al. Seeing the Bigger Picture: How Nodes Can Learn Their Place Within a Complex Ad Hoc Network Topology , 2013, IEEE Signal Processing Magazine.
[31] Jure Leskovec,et al. Defining and evaluating network communities based on ground-truth , 2012, Knowledge and Information Systems.
[32] R. Durrett. Random Graph Dynamics: References , 2006 .
[33] Anna Scaglione,et al. Models for the Diffusion of Beliefs in Social Networks: An Overview , 2013, IEEE Signal Processing Magazine.
[34] Iain S. Duff,et al. Users' guide for the Harwell-Boeing sparse matrix collection (Release 1) , 1992 .
[35] Annalisa Massini,et al. Antibandwidth of Complete k-Ary Trees , 2006, Electron. Notes Discret. Math..
[36] Patrick Flandrin,et al. Nonnegative matrix factorization to find features in temporal networks , 2014, ICASSP.
[37] E. Cuthill,et al. Reducing the bandwidth of sparse symmetric matrices , 1969, ACM '69.
[38] Jure Leskovec,et al. {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .
[39] Jing-Ho Yan,et al. A study on cyclic bandwidth sum , 2007, J. Comb. Optim..
[40] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[41] Christos H. Papadimitriou,et al. The NP-Completeness of the bandwidth minimization problem , 1976, Computing.