Search results for "Spanning-Tree"

Hits ?▲	Authors	Title	Venue	Year	Link
15	Arkadev Chattopadhyay, Rajit Datta, Utsab Ghosal, Partha Mukhopadhyay	Monotone Complexity of Spanning Tree Polynomial Re-Visited.	ITCS	2022	DBLP DOI BibTeX RDF
15	Parijat Sen, Debopriya Barman	Cellular Automata Based Model for Finding Minimum Spanning Tree in Wireless Sensor Networks.	ASCAT	2022	DBLP DOI BibTeX RDF
15	Bruno José da Silva Barros, Luiz Satoru Ochi, Rian Gabriel S. Pinheiro, Uéverton S. Souza	On Conflict-Free Spanning Tree: Algorithms and Complexity.	CALDAM	2022	DBLP DOI BibTeX RDF
15	Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, Jens Schlöter	Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty.	ESA	2022	DBLP DOI BibTeX RDF
15	Martin Byrenheid, Stefanie Roos, Thorsten Strufe	Topology Inference of Networks utilizing Rooted Spanning Tree Embeddings.	ICDCN	2022	DBLP DOI BibTeX RDF
15	Zhibin Tan, Zhigang Cao, Zhengxing Zou	Matrix-Exact Covers of Minimum-Cost-Spanning-Tree Games.	WINE	2022	DBLP BibTeX RDF
15	Haitao Wang 0001, Yiming Zhao	Computing the Minimum Bottleneck Moving Spanning Tree.	MFCS	2022	DBLP DOI BibTeX RDF
15	David R. Alves, Vijay K. Garg	Parallel Minimum Spanning Tree Algorithms via Lattice Linear Predicate Detection.	IPDPS Workshops	2022	DBLP DOI BibTeX RDF
15	Ro-Yu Wu, Cheng-Chia Tseng, Ling-Ju Hung, Jou-Ming Chang	Generating Spanning-Tree Sequences of a Fan Graph in Lexicographic Order and Ranking/Unranking Algorithms.	ISCO	2022	DBLP DOI BibTeX RDF
15	Sinchan Sengupta, Sathya Peri, Parwat Singh Anjana	A Self-stabilizing Minimum Average Stretch Spanning Tree Construction.	NETYS	2022	DBLP DOI BibTeX RDF
15	Mohsen Koohi Esfahani, Peter Kilpatrick, Hans Vandierendonck	MASTIFF: structure-aware minimum spanning tree/forest.	ICS	2022	DBLP DOI BibTeX RDF
15	Benjamin Doerr, Amirhossein Rajabi, Carsten Witt	Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem.	GECCO	2022	DBLP DOI BibTeX RDF
15	Priyesh Ranjan, Federico Corò, Ashish Gupta 0012, Sajal K. Das 0001	Leveraging Spanning Tree to Detect Colluding Attackers in Federated Learning.	INFOCOM Workshops	2022	DBLP DOI BibTeX RDF
15	Mohammad Hamdani, Dedy Irawan, A. A. N. Ananda Kusuma, Tahar Agastani, Muhammad Iqbal	Preliminary Assessment of Using Spanning Tree Open Protocols in INA-CBT Communication System.	IC3INA	2022	DBLP DOI BibTeX RDF
15	Jie Deng 0004, Wei Wang 0099, Ronghui Zhan, Jun Zhang 0044	Hierarchical Segmentation for Polsar Image Using Minimum Spanning Tree.	IGARSS	2022	DBLP DOI BibTeX RDF
15	Sungsoo Ahn, Binghong Chen, Tianzhe Wang, Le Song	Spanning Tree-based Graph Generation for Molecules.	ICLR	2022	DBLP BibTeX RDF
15	Qingzhen Dong, Xianyue Li, Yu Yang	Partial Inverse Min-Max Spanning Tree Problem Under the Weighted Bottleneck Hamming Distance.	AAIM	2022	DBLP DOI BibTeX RDF
15	Luis Salazar-Zendeja	Models and Algorithms for the Minimum Spanning Tree Interdiction Problem. (Modèles et Algorithmes pour le Problème d'Interdiction de l'Arbre Couvrant de Poids Minimal).		2022	RDF
15	Manolis N. Kritikos, George Ioannou	The capacitated minimum spanning tree problem with arc time windows.	Expert Syst. Appl.	2021	DBLP DOI BibTeX RDF
15	Alan M. Frieze, Tomasz Tkocz	A Randomly Weighted Minimum Spanning Tree with a Random Cost Constraint.	Electron. J. Comb.	2021	DBLP DOI BibTeX RDF
15	Manuel Aprile, Samuel Fiorini, Tony Huynh, Gwenaël Joret, David R. Wood	Smaller Extended Formulations for Spanning Tree Polytopes in Minor-closed Classes and Beyond.	Electron. J. Comb.	2021	DBLP DOI BibTeX RDF
15	Max Pitz	Quickly Proving Diestel's Normal Spanning Tree Criterion.	Electron. J. Comb.	2021	DBLP DOI BibTeX RDF
15	Gustavo Bergantiños, Leticia Lorenzo	Cost additive rules in minimum cost spanning tree problems with multiple sources.	Ann. Oper. Res.	2021	DBLP DOI BibTeX RDF
15	Francesco Carrabs, Raffaele Cerulli, Rosa Pentangelo, Andrea Raiconi	Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach.	Ann. Oper. Res.	2021	DBLP DOI BibTeX RDF
15	Vida Doryanizadeh, Amin Keshavarzi, Tajedin Derikvand, Mahdi Bohlouli	Energy Efficient Cluster Head Selection in Internet of Things Using Minimum Spanning Tree (EEMST).	Appl. Artif. Intell.	2021	DBLP DOI BibTeX RDF
15	Xiaojun Zhu 0001, Shaojie Tang 0001	Exact Algorithms for the Minimum Load Spanning Tree Problem.	INFORMS J. Comput.	2021	DBLP DOI BibTeX RDF
15	Ningji Wei, Jose L. Walteros, Foad Mahdavi Pajouh	Integer Programming Formulations for Minimum Spanning Tree Interdiction.	INFORMS J. Comput.	2021	DBLP DOI BibTeX RDF
15		Topic flexible aspect based sentiment analysis using minimum spanning tree with Cuckoo search.	J. Ambient Intell. Humaniz. Comput.	2021	DBLP DOI BibTeX RDF
15	Prem Prakash Vuppuluri, Chellapilla Patvardhan	Serial and parallel memetic algorithms for the bounded diameter minimum spanning tree problem.	Expert Syst. J. Knowl. Eng.	2021	DBLP DOI BibTeX RDF
15	Carlos Contreras Bolton, Víctor Parada	An effective two-level solution approach for the prize-collecting generalized minimum spanning tree problem by iterated local search.	Int. Trans. Oper. Res.	2021	DBLP DOI BibTeX RDF
15	Martine Labbé, Miguel A. Pozo, Justo Puerto	Computational comparisons of different formulations for the Stackelberg minimum spanning tree game.	Int. Trans. Oper. Res.	2021	DBLP DOI BibTeX RDF
15	Ali Mashreghi, Valerie King	Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model.	Distributed Comput.	2021	DBLP DOI BibTeX RDF
15	Umar Ali, Hassan Raza, Yasir Ahmed	On Normalized Laplacians, Degree-Kirchhoff Index and Spanning Tree of Generalized Phenylene.	Symmetry	2021	DBLP DOI BibTeX RDF
15	Liang Wu, Haoyong Chen	Spanning-Tree-Based Synchronization Conditions for Second-Order Kuramoto Networks.	IEEE Trans. Circuits Syst. II Express Briefs	2021	DBLP DOI BibTeX RDF
15	Muhammad Aliyu, Murali M., Abdulsalam Ya'u Gital, Souley Boukari, Rumana Kabir, Maryam Abdullahi Musa, Fatima Umar Zambuk, Joshua Caleb Shawulu, Ibrahim M. Umar	A Multi-Tier Architecture for the Management of Supply Chain of Cloud Resources in a Virtualized Cloud Environment: A Novel SCM Technique for Cloud Resources Using Ant Colony Optimization and Spanning Tree.	Int. J. Inf. Syst. Supply Chain Manag.	2021	DBLP DOI BibTeX RDF
15	Dilson Almeida Guimarães, Alexandre Salles da Cunha	The minimum area spanning tree problem: Formulations, Benders decomposition and branch-and-cut algorithms.	Comput. Geom.	2021	DBLP DOI BibTeX RDF
15	Feng Shi 0003, Frank Neumann 0001, Jianxin Wang 0001	Time complexity analysis of evolutionary algorithms for 2-hop (1, 2)-minimum spanning tree problem.	Theor. Comput. Sci.	2021	DBLP DOI BibTeX RDF
15	Tatsuya Matsuoka, Naoto Ohsaka	Spanning tree constrained determinantal point processes are hard to (approximately) evaluate.	Oper. Res. Lett.	2021	DBLP DOI BibTeX RDF
15	Xingfu Li, Daming Zhu, Lusheng Wang 0001	A 43-approximation algorithm for the Maximum Internal Spanning Tree Problem.	J. Comput. Syst. Sci.	2021	DBLP DOI BibTeX RDF
15	Shi Dong 0001, Mudar Sarem, Wengang Zhou	Distributed Data Gathering Algorithm Based on Spanning Tree.	IEEE Syst. J.	2021	DBLP DOI BibTeX RDF
15	Jang Pyo Bae, Siyeop Yoon, Malinda Vania, Deukhee Lee	Spatiotemporal Free-Form Registration Method Assisted by a Minimum Spanning Tree During Discontinuous Transformations.	J. Digit. Imaging	2021	DBLP DOI BibTeX RDF
15	Zhilei Xu, Wei Huang 0008, Jinsong Wang	A time-varying neural network for solving minimum spanning tree problem on time-varying network.	Neurocomputing	2021	DBLP DOI BibTeX RDF
15	Xianbin Zhu 0002, Wenjun Li 0001, Yongjie Yang 0001, Jianxin Wang 0001	Incremental algorithms for the maximum internal spanning tree problem.	Sci. China Inf. Sci.	2021	DBLP DOI BibTeX RDF
15	Binayak Ghosh, Mahdi Motagh, Mahmud Haghshenas-Haghighi, Magdalena Vassileva, Thomas R. Walter, Setareh Maghsudi	Automatic Detection of Volcanic Unrest Using Blind Source Separation With a Minimum Spanning Tree Based Stability Analysis.	IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens.	2021	DBLP DOI BibTeX RDF
15	Ran Zmigrod, Tim Vieira, Ryan Cotterell	Efficient Computation of Expectations under Spanning Tree Distributions.	Trans. Assoc. Comput. Linguistics	2021	DBLP DOI BibTeX RDF
15	Dongdong Cheng, Qingsheng Zhu, Jinlong Huang, Quanwang Wu, Lijun Yang	Clustering with Local Density Peaks-Based Minimum Spanning Tree.	IEEE Trans. Knowl. Data Eng.	2021	DBLP DOI BibTeX RDF
15	Binwu Zhang, Xiucui Guan, Panos M. Pardalos, Hui Wang, Qiao Zhang, Yan Liu, Shuyi Chen	The lower bounded inverse optimal value problem on minimum spanning tree under unit l∞ norm.	J. Glob. Optim.	2021	DBLP DOI BibTeX RDF
15	Feng Shi 0003, Frank Neumann 0001, Jianxin Wang 0001	Time Complexity Analysis of Evolutionary Algorithms for 2-Hop (1, 2)-Minimum Spanning Tree Problem.	CoRR	2021	DBLP BibTeX RDF
15	Arnaud Casteigts, Yves Métivier, John Michael Robson	Revisiting the Role of Coverings in Anonymous Networks: Spanning Tree Construction and Topology Recognition.	CoRR	2021	DBLP BibTeX RDF
15	Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy	On the minimum spanning tree problem in imprecise set-up.	CoRR	2021	DBLP BibTeX RDF
15	Martin Byrenheid, Stefanie Roos, Thorsten Strufe	Topology Inference of Networks utilizing Rooted Spanning Tree Embeddings.	CoRR	2021	DBLP BibTeX RDF
15	Gopika Sharma, Arti Pandey, Michael C. Wigal	Algorithms for Maximum Internal Spanning Tree Problem for Some Graph Classes.	CoRR	2021	DBLP BibTeX RDF
15	Tatsuya Matsuoka, Naoto Ohsaka	Spanning Tree Constrained Determinantal Point Processes are Hard to (Approximately) Evaluate.	CoRR	2021	DBLP BibTeX RDF
15	Filipe F. C. Silva, Pedro M. S. Carvalho, Luis A. F. M. Ferreira, Yasser Omar	A QUBO Formulation for Minimum Loss Spanning Tree Reconfiguration Problems in Electric Power Networks.	CoRR	2021	DBLP BibTeX RDF
15	Alexander Veremyev, Mikhail V. Goubko	Mixed-Integer Approaches to Constrained Optimum Communication Spanning Tree Problem.	CoRR	2021	DBLP BibTeX RDF
15	Yiqiu Wang, Shangdi Yu, Yan Gu 0001, Julian Shun	Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering.	CoRR	2021	DBLP BibTeX RDF
15	Manuel Aprile, Samuel Fiorini, Tony Huynh, Gwenaël Joret, David R. Wood	Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond.	CoRR	2021	DBLP BibTeX RDF
15	Manuel Dubinsky, César Massri, Gabriel Taubin	Minimum Spanning Tree Cycle Intersection Problem.	CoRR	2021	DBLP BibTeX RDF
15	Arkadev Chattopadhyay, Rajit Datta, Utsab Ghosal, Partha Mukhopadhyay	Monotone Complexity of Spanning Tree Polynomial Re-visited.	CoRR	2021	DBLP BibTeX RDF
15	Kavita Singh, Shyam Sundar 0001	Artificial bee colony algorithm using permutation encoding for the bounded diameter minimum spanning tree problem.	Soft Comput.	2021	DBLP DOI BibTeX RDF
15	Surajit Dan, Saibal Majumder, Mohuya B. Kar, Samarjit Kar	On type-2 fuzzy weighted minimum spanning tree.	Soft Comput.	2021	DBLP DOI BibTeX RDF
15	Wenbao Qiao, Jean-Charles Créput	Component-based 2-/3-dimensional nearest neighbor search based on Elias method to GPU parallel 2D/3D Euclidean Minimum Spanning Tree Problem.	Appl. Soft Comput.	2021	DBLP DOI BibTeX RDF
15	Sudishna Ghoshal, Shyam Sundar 0001	Two approaches for the min-degree constrained minimum spanning tree problem.	Appl. Soft Comput.	2021	DBLP DOI BibTeX RDF
15	Manuel Dubinsky, César Massri, Gabriel Taubin	Minimum Spanning Tree Cycle Intersection problem.	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
15	Junjiang Li, Guifu Su, Guanbang Song	New comments on "A Hamilton sufficient condition for completely independent spanning tree".	Discret. Appl. Math.	2021	DBLP DOI BibTeX RDF
15	Yoshimi Egawa, Michitaka Furuya, Hajime Matsumura	Existence of a spanning tree having small diameter.	Discret. Math.	2021	DBLP DOI BibTeX RDF
15	Baoyindureng Wu, Heping Zhang	Graphs where each spanning tree has a perfect matching.	Contributions Discret. Math.	2021	DBLP BibTeX RDF
15	Dongdong Yue, Simone Baldi, Jinde Cao, Qi Li 0017, Bart De Schutter	A Directed Spanning Tree Adaptive Control Solution to Time-Varying Formations.	IEEE Trans. Control. Netw. Syst.	2021	DBLP DOI BibTeX RDF
15	Francesco Carrabs, Manlio Gaudioso	A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs.	Networks	2021	DBLP DOI BibTeX RDF
15	Jinglian Liu, Daling Wang, Shi Feng 0001, Yifei Zhang 0003	An Approach of Community Search with Minimum Spanning Tree Based on Node Embedding.	Complex.	2021	DBLP DOI BibTeX RDF
15	Luiz Alberto do Carmo Viana, Manoel B. Campêlo, Ignasi Sau, Ana Silva 0001	A unifying model for locally constrained spanning tree problems.	J. Comb. Optim.	2021	DBLP DOI BibTeX RDF
15	Hui Wang, Xiucui Guan, Qiao Zhang, Binwu Zhang	Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance.	J. Comb. Optim.	2021	DBLP DOI BibTeX RDF
15	Ke Wang 0004, Yulin Zhou, Guichao Tian, Mark Goh	A structured solution framework for fuzzy minimum spanning tree problem and its variants under different criteria.	Fuzzy Optim. Decis. Mak.	2021	DBLP DOI BibTeX RDF
15	Walter Guttmann, Nicolas Robinson-O'Brien	Relation-Algebraic Verification of Borůvka's Minimum Spanning Tree Algorithm.	RAMiCS	2021	DBLP DOI BibTeX RDF
15	Ahmad Biniaz	Approximating Longest Spanning Tree with Neighborhoods.	ISAAC	2021	DBLP DOI BibTeX RDF
15	Xiaoxin Wang, Xuyun Wen, Kai Ma, Daoqiang Zhang	A Multilayer Maximum Spanning Tree Kernel For Brain Networks.	ISBI	2021	DBLP DOI BibTeX RDF
15	Vahag Bejanyan, Hrachya V. Astsatryan	A PGAS-Based Implementation for the Parallel Minimum Spanning Tree Algorithm.	LSSC	2021	DBLP DOI BibTeX RDF
15	Pablo Adasme, Ali Dehghan Firoozabadi	On a Wireless Sensor Network Problem with Spanning Tree Backbone.	WINSYS	2021	DBLP DOI BibTeX RDF
15	Yiqiu Wang, Shangdi Yu, Yan Gu 0001, Julian Shun	Fast Parallel Algorithms for Euclidean Minimum Spanning Tree and Hierarchical Spatial Clustering.	SIGMOD Conference	2021	DBLP DOI BibTeX RDF
15	Hugo A. Akitaya, Ahmad Biniaz, Prosenjit Bose, Jean-Lou De Carufel, Anil Maheshwari, Luís Fernando Schultz Xavier da Silveira, Michiel Smid	The Minimum Moving Spanning Tree Problem.	WADS	2021	DBLP DOI BibTeX RDF
15	Jakob Bossek, Frank Neumann 0001	Evolutionary diversity optimization and the minimum spanning tree problem.	GECCO	2021	DBLP DOI BibTeX RDF
15	Matvey Shnytkin, Denis Antipov	The lower bounds on the runtime of the (1 + (λ, λ)) GA on the minimum spanning tree problem.	GECCO Companion	2021	DBLP DOI BibTeX RDF
15	Xianyue Li, Ruowang Yang, Heping Zhang, Zhao Zhang 0002	Capacitated Partial Inverse Maximum Spanning Tree Under the Weighted l∞ -norm.	COCOA	2021	DBLP DOI BibTeX RDF
15	Esra Çakir, H. Ziya Ulukan	An Intuitionistic Fuzzy MCDM Approach Adapted to Minimum Spanning Tree Algorithm for Spreading Content on Social Media.	CCWC	2021	DBLP DOI BibTeX RDF
15	Chandra Chekuri, Kent Quanrud, Manuel R. Torres	Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems.	APPROX-RANDOM	2021	DBLP DOI BibTeX RDF
15	Ivan Ostroumov, Oleg Ivashchuk, Sergii Babichev	Risk of mid-air collision estimation using minimum spanning tree of air traffic graph.	CITRisk	2021	DBLP BibTeX RDF
15	Priyanka Das 0002, Asit Kumar Das, Janmenjoy Nayak	Feature selection generating directed rough-spanning tree for crime pattern analysis.	Neural Comput. Appl.	2020	DBLP DOI BibTeX RDF
15	Cynthia Jayapal, Senthil Jayavel, V. Vanitha	Enhancing the performance of service discovery protocol using minimum spanning tree.	Int. J. Mob. Commun.	2020	DBLP DOI BibTeX RDF
15	Prem Prakash Vuppuluri, C. Patvardhan 0001	Novel Heuristics for the Euclidean Leaf-Constrained Minimum Spanning Tree Problem.	SN Comput. Sci.	2020	DBLP DOI BibTeX RDF
15	Marco Aurélio Lopes Barbosa, Alexandre C. B. Delbem, Letícia Rodrigues Bueno	Data Structures for Direct Spanning Tree Representations in Mutation-Based Evolutionary Algorithms.	IEEE Trans. Evol. Comput.	2020	DBLP DOI BibTeX RDF
15	Muhammad Aliyu, Murali M., Abdulsalam Ya'u Gital, Souley Boukari	Efficient Metaheuristic Population-Based and Deterministic Algorithm for Resource Provisioning Using Ant Colony Optimization and Spanning Tree.	Int. J. Cloud Appl. Comput.	2020	DBLP DOI BibTeX RDF
15	Wenjie Lin, Yu Li	Parallel Regional Segmentation Method of High-Resolution Remote Sensing Image Based on Minimum Spanning Tree.	Remote. Sens.	2020	DBLP DOI BibTeX RDF
15	Feodor F. Dragan	An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time.	Inf. Process. Lett.	2020	DBLP DOI BibTeX RDF
15	Islame F. C. Fernandes, Elizabeth Ferreira Gouvea Goldbarg, Sílvia M. D. M. Maia, Marco César Goldbarg	Empirical study of exact algorithms for the multi-objective spanning tree.	Comput. Optim. Appl.	2020	DBLP DOI BibTeX RDF
15	Murat Çaliskan, Berk Anbaroglu	Geo-MST: A geographical minimum spanning tree plugin for QGIS.	SoftwareX	2020	DBLP DOI BibTeX RDF
15	Dianhao Zheng, J. Andrew Zhang, Hongbin Zhang 0002, Wei Xing Zheng 0001, Steven W. Su	Consensus of Second-Order Multi-Agent Systems Without a Spanning Tree: A Sequence-Based Topology-Dependent Method.	IEEE Access	2020	DBLP DOI BibTeX RDF
15	Leonardo Gigli, Santiago Velasco-Forero, Beatriz Marcotegui	On minimum spanning tree streaming for hierarchical segmentation.	Pattern Recognit. Lett.	2020	DBLP DOI BibTeX RDF
15	Gaurav Mishra, Sraban Kumar Mohanty	A minimum spanning tree based partitioning and merging technique for clustering heterogeneous data sets.	J. Intell. Inf. Syst.	2020	DBLP DOI BibTeX RDF
15	Lan Lin, Yixun Lin	Optimality computation of the minimum stretch spanning tree problem.	Appl. Math. Comput.	2020	DBLP DOI BibTeX RDF
15	Lan Lin, Yixun Lin	The Minimum Stretch Spanning Tree Problem for Hamming Graphs and Higher-Dimensional Grids.	J. Interconnect. Networks	2020	DBLP DOI BibTeX RDF