Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
15 | Arkadev Chattopadhyay, Rajit Datta, Utsab Ghosal, Partha Mukhopadhyay |
Monotone Complexity of Spanning Tree Polynomial Re-Visited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITCS ![In: 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA., pp. 39:1-39:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-217-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Parijat Sen, Debopriya Barman |
Cellular Automata Based Model for Finding Minimum Spanning Tree in Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ASCAT ![In: Proceedings of First Asian Symposium on Cellular Automata Technology - ASCAT 2022, Kolkata, India, 3-5 March 2022, pp. 205-220, 2022, Springer, 978-981-19-0541-4. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CALDAM ![In: Algorithms and Discrete Applied Mathematics - 8th International Conference, CALDAM 2022, Puducherry, India, February 10-12, 2022, Proceedings, pp. 91-102, 2022, Springer, 978-3-030-95017-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany., pp. 49:1-49:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-247-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Martin Byrenheid, Stefanie Roos, Thorsten Strufe |
Topology Inference of Networks utilizing Rooted Spanning Tree Embeddings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCN ![In: ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4 - 7, 2022, pp. 107-116, 2022, ACM, 978-1-4503-9560-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Zhibin Tan, Zhigang Cao, Zhengxing Zou |
Matrix-Exact Covers of Minimum-Cost-Spanning-Tree Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINE ![In: Web and Internet Economics - 18th International Conference, WINE 2022, Troy, NY, USA, December 12-15, 2022, Proceedings, pp. 373, 2022, Springer, 978-3-031-22831-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
15 | Haitao Wang 0001, Yiming Zhao |
Computing the Minimum Bottleneck Moving Spanning Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria., pp. 82:1-82:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-256-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | David R. Alves, Vijay K. Garg |
Parallel Minimum Spanning Tree Algorithms via Lattice Linear Predicate Detection. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS Workshops ![In: IEEE International Parallel and Distributed Processing Symposium, IPDPS Workshops 2022, Lyon, France, May 30 - June 3, 2022, pp. 774-782, 2022, IEEE, 978-1-6654-9747-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCO ![In: Combinatorial Optimization - 7th International Symposium, ISCO 2022, Virtual Event, May 18-20, 2022, Revised Selected Papers, pp. 201-211, 2022, Springer, 978-3-031-18529-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Sinchan Sengupta, Sathya Peri, Parwat Singh Anjana |
A Self-stabilizing Minimum Average Stretch Spanning Tree Construction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NETYS ![In: Networked Systems - 10th International Conference, NETYS 2022, Virtual Event, May 17-19, 2022, Proceedings, pp. 119-135, 2022, Springer, 978-3-031-17435-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Mohsen Koohi Esfahani, Peter Kilpatrick, Hans Vandierendonck |
MASTIFF: structure-aware minimum spanning tree/forest. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICS ![In: ICS '22: 2022 International Conference on Supercomputing, Virtual Event, June 28 - 30, 2022, pp. 9:1-9:13, 2022, ACM, 978-1-4503-9281-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: GECCO '22: Genetic and Evolutionary Computation Conference, Boston, Massachusetts, USA, July 9 - 13, 2022, pp. 1381-1389, 2022, ACM, 978-1-4503-9237-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFOCOM Workshops ![In: IEEE INFOCOM 2022 - IEEE Conference on Computer Communications Workshops, INFOCOM 2022 - Workshops, New York, NY, USA, May 2-5, 2022, pp. 1-2, 2022, IEEE, 978-1-6654-0926-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IC3INA ![In: The 2022 International Conference on Computer, Control, Informatics and Its Applications, IC3INA 2022, Virtual Event, Indonesia, November 22-23, 2022., pp. 6-10, 2022, ACM, 978-1-4503-9790-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IGARSS ![In: IEEE International Geoscience and Remote Sensing Symposium, IGARSS 2022, Kuala Lumpur, Malaysia, July 17-22, 2022, pp. 979-982, 2022, IEEE, 978-1-6654-2792-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Sungsoo Ahn, Binghong Chen, Tianzhe Wang, Le Song |
Spanning Tree-based Graph Generation for Molecules. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLR ![In: The Tenth International Conference on Learning Representations, ICLR 2022, Virtual Event, April 25-29, 2022, 2022, OpenReview.net. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
15 | Qingzhen Dong, Xianyue Li, Yu Yang |
Partial Inverse Min-Max Spanning Tree Problem Under the Weighted Bottleneck Hamming Distance. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAIM ![In: Algorithmic Aspects in Information and Management - 16th International Conference, AAIM 2022, Guangzhou, China, August 13-14, 2022, Proceedings, pp. 351-362, 2022, Springer, 978-3-031-16080-6. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2022 |
RDF |
|
15 | Manolis N. Kritikos, George Ioannou |
The capacitated minimum spanning tree problem with arc time windows. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. Appl. ![In: Expert Syst. Appl. 176, pp. 114859, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Alan M. Frieze, Tomasz Tkocz |
A Randomly Weighted Minimum Spanning Tree with a Random Cost Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 28(1), pp. 1, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 28(4), 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Max Pitz |
Quickly Proving Diestel's Normal Spanning Tree Criterion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 28(3), 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Gustavo Bergantiños, Leticia Lorenzo |
Cost additive rules in minimum cost spanning tree problems with multiple sources. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 301(1), pp. 5-15, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Oper. Res. ![In: Ann. Oper. Res. 298(1), pp. 65-78, 2021. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Artif. Intell. ![In: Appl. Artif. Intell. 35(15), pp. 1777-1802, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Xiaojun Zhu 0001, Shaojie Tang 0001 |
Exact Algorithms for the Minimum Load Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFORMS J. Comput. ![In: INFORMS J. Comput. 33(4), pp. 1431-1445, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Ningji Wei, Jose L. Walteros, Foad Mahdavi Pajouh |
Integer Programming Formulations for Minimum Spanning Tree Interdiction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
INFORMS J. Comput. ![In: INFORMS J. Comput. 33(4), pp. 1461-1480, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | |
Topic flexible aspect based sentiment analysis using minimum spanning tree with Cuckoo search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Ambient Intell. Humaniz. Comput. ![In: J. Ambient Intell. Humaniz. Comput. 12(7), pp. 7399-7406, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Prem Prakash Vuppuluri, Chellapilla Patvardhan |
Serial and parallel memetic algorithms for the bounded diameter minimum spanning tree problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Expert Syst. J. Knowl. Eng. ![In: Expert Syst. J. Knowl. Eng. 38(2), 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. Trans. Oper. Res. ![In: Int. Trans. Oper. Res. 28(3), pp. 1190-1212, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. Trans. Oper. Res. ![In: Int. Trans. Oper. Res. 28(1), pp. 48-69, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Ali Mashreghi, Valerie King |
Broadcast and minimum spanning tree with o(m) messages in the asynchronous CONGEST model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 34(4), pp. 283-299, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Umar Ali, Hassan Raza, Yasir Ahmed |
On Normalized Laplacians, Degree-Kirchhoff Index and Spanning Tree of Generalized Phenylene. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Symmetry ![In: Symmetry 13(8), pp. 1374, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Liang Wu, Haoyong Chen |
Spanning-Tree-Based Synchronization Conditions for Second-Order Kuramoto Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Circuits Syst. II Express Briefs ![In: IEEE Trans. Circuits Syst. II Express Briefs 68(4), pp. 1448-1452, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Inf. Syst. Supply Chain Manag. ![In: Int. J. Inf. Syst. Supply Chain Manag. 14(3), pp. 1-17, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Geom. ![In: Comput. Geom. 97, pp. 101771, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 893, pp. 159-175, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Tatsuya Matsuoka, Naoto Ohsaka |
Spanning tree constrained determinantal point processes are hard to (approximately) evaluate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Oper. Res. Lett. ![In: Oper. Res. Lett. 49(3), pp. 304-309, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Xingfu Li, Daming Zhu, Lusheng Wang 0001 |
A 43-approximation algorithm for the Maximum Internal Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 118, pp. 131-140, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Shi Dong 0001, Mudar Sarem, Wengang Zhou |
Distributed Data Gathering Algorithm Based on Spanning Tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Syst. J. ![In: IEEE Syst. J. 15(1), pp. 289-296, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Digit. Imaging ![In: J. Digit. Imaging 34(1), pp. 190-203, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neurocomputing ![In: Neurocomputing 466, pp. 139-147, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Sci. China Inf. Sci. ![In: Sci. China Inf. Sci. 64(5), 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens. ![In: IEEE J. Sel. Top. Appl. Earth Obs. Remote. Sens. 14, pp. 7771-7787, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Ran Zmigrod, Tim Vieira, Ryan Cotterell |
Efficient Computation of Expectations under Spanning Tree Distributions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Trans. Assoc. Comput. Linguistics ![In: Trans. Assoc. Comput. Linguistics 9, pp. 675-690, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 33(2), pp. 374-387, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 79(3), pp. 757-777, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2110.04701, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2101.01409, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
15 | Sanjana Dey, Ramesh K. Jallu, Subhas C. Nandy |
On the minimum spanning tree problem in imprecise set-up. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.04229, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
15 | Martin Byrenheid, Stefanie Roos, Thorsten Strufe |
Topology Inference of Networks utilizing Rooted Spanning Tree Embeddings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2108.04374, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
15 | Gopika Sharma, Arti Pandey, Michael C. Wigal |
Algorithms for Maximum Internal Spanning Tree Problem for Some Graph Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2112.02248, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
15 | Tatsuya Matsuoka, Naoto Ohsaka |
Spanning Tree Constrained Determinantal Point Processes are Hard to (Approximately) Evaluate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.12646, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2109.09659, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
15 | Alexander Veremyev, Mikhail V. Goubko |
Mixed-Integer Approaches to Constrained Optimum Communication Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2101.03872, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2104.01126, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2106.11945, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
15 | Manuel Dubinsky, César Massri, Gabriel Taubin |
Minimum Spanning Tree Cycle Intersection Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2102.13193, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
15 | Arkadev Chattopadhyay, Rajit Datta, Utsab Ghosal, Partha Mukhopadhyay |
Monotone Complexity of Spanning Tree Polynomial Re-visited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2109.06941, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 25(16), pp. 11289-11305, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Surajit Dan, Saibal Majumder, Mohuya B. Kar, Samarjit Kar |
On type-2 fuzzy weighted minimum spanning tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 25(23), pp. 14873-14892, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Soft Comput. ![In: Appl. Soft Comput. 100, pp. 106928, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Sudishna Ghoshal, Shyam Sundar 0001 |
Two approaches for the min-degree constrained minimum spanning tree problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Soft Comput. ![In: Appl. Soft Comput. 111, pp. 107715, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Manuel Dubinsky, César Massri, Gabriel Taubin |
Minimum Spanning Tree Cycle Intersection problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 294, pp. 152-166, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Junjiang Li, Guifu Su, Guanbang Song |
New comments on "A Hamilton sufficient condition for completely independent spanning tree". ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 305, pp. 10-15, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Yoshimi Egawa, Michitaka Furuya, Hajime Matsumura |
Existence of a spanning tree having small diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 344(11), pp. 112548, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Baoyindureng Wu, Heping Zhang |
Graphs where each spanning tree has a perfect matching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Contributions Discret. Math. ![In: Contributions Discret. Math. 16(3), pp. 1-8, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Control. Netw. Syst. ![In: IEEE Trans. Control. Netw. Syst. 8(2), pp. 690-701, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Francesco Carrabs, Manlio Gaudioso |
A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Networks ![In: Networks 78(1), pp. 32-45, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Complex. ![In: Complex. 2021, pp. 6673444:1-6673444:13, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 42(1), pp. 125-150, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 41(4), pp. 861-887, 2021. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fuzzy Optim. Decis. Mak. ![In: Fuzzy Optim. Decis. Mak. 20(4), pp. 497-528, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Walter Guttmann, Nicolas Robinson-O'Brien |
Relation-Algebraic Verification of Borůvka's Minimum Spanning Tree Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RAMiCS ![In: Relational and Algebraic Methods in Computer Science - 19th International Conference, RAMiCS 2021, Marseille, France, November 2-5, 2021, Proceedings, pp. 225-240, 2021, Springer, 978-3-030-88700-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Ahmad Biniaz |
Approximating Longest Spanning Tree with Neighborhoods. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 32nd International Symposium on Algorithms and Computation, ISAAC 2021, December 6-8, 2021, Fukuoka, Japan., pp. 7:1-7:11, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-214-3. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Xiaoxin Wang, Xuyun Wen, Kai Ma, Daoqiang Zhang |
A Multilayer Maximum Spanning Tree Kernel For Brain Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISBI ![In: 18th IEEE International Symposium on Biomedical Imaging, ISBI 2021, Nice, France, April 13-16, 2021, pp. 1582-1585, 2021, IEEE, 978-1-6654-1246-9. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Vahag Bejanyan, Hrachya V. Astsatryan |
A PGAS-Based Implementation for the Parallel Minimum Spanning Tree Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LSSC ![In: Large-Scale Scientific Computing - 13th International Conference, LSSC 2021, Sozopol, Bulgaria, June 7-11, 2021, Revised Selected Papers, pp. 431-438, 2021, Springer, 978-3-030-97548-7. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Pablo Adasme, Ali Dehghan Firoozabadi |
On a Wireless Sensor Network Problem with Spanning Tree Backbone. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WINSYS ![In: Proceedings of the 18th International Conference on Wireless Networks and Mobile Systems, WINSYS 2021, Online Streaming, July 7-9, 2021., pp. 76-82, 2021, SCITEPRESS, 978-989-758-529-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGMOD Conference ![In: SIGMOD '21: International Conference on Management of Data, Virtual Event, China, June 20-25, 2021., pp. 1982-1995, 2021, ACM, 978-1-4503-8343-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures - 17th International Symposium, WADS 2021, Virtual Event, August 9-11, 2021, Proceedings, pp. 15-28, 2021, Springer, 978-3-030-83507-1. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Jakob Bossek, Frank Neumann 0001 |
Evolutionary diversity optimization and the minimum spanning tree problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO ![In: GECCO '21: Genetic and Evolutionary Computation Conference, Lille, France, July 10-14, 2021., pp. 198-206, 2021, ACM, 978-1-4503-8350-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO Companion ![In: GECCO '21: Genetic and Evolutionary Computation Conference, Companion Volume, Lille, France, July 10-14, 2021., pp. 1986-1989, 2021, ACM, 978-1-4503-8351-6. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications - 15th International Conference, COCOA 2021, Tianjin, China, December 17-19, 2021, Proceedings, pp. 389-399, 2021, Springer, 978-3-030-92680-9. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCWC ![In: 11th IEEE Annual Computing and Communication Workshop and Conference, CCWC 2021, Las Vegas, NV, USA, January 27-30, 2021, pp. 174-179, 2021, IEEE, 978-1-6654-1490-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Chandra Chekuri, Kent Quanrud, Manuel R. Torres |
Fast Approximation Algorithms for Bounded Degree and Crossing Spanning Tree Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021, August 16-18, 2021, University of Washington, Seattle, Washington, USA (Virtual Conference)., pp. 24:1-24:21, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-207-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CITRisk ![In: Proceedings of the 2nd International Workshop on Computational & Information Technologies for Risk-Informed Systems (CITRisk 2021) co-located with XXI International Conference on Information Technologies in Education and Management (ITEM 2021), Kherson, Ukraine, September 16-17, 2021., pp. 322-334, 2021, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
15 | Priyanka Das 0002, Asit Kumar Das, Janmenjoy Nayak |
Feature selection generating directed rough-spanning tree for crime pattern analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Neural Comput. Appl. ![In: Neural Comput. Appl. 32(12), pp. 7623-7639, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Cynthia Jayapal, Senthil Jayavel, V. Vanitha |
Enhancing the performance of service discovery protocol using minimum spanning tree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Mob. Commun. ![In: Int. J. Mob. Commun. 18(4), pp. 443-461, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Prem Prakash Vuppuluri, C. Patvardhan 0001 |
Novel Heuristics for the Euclidean Leaf-Constrained Minimum Spanning Tree Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SN Comput. Sci. ![In: SN Comput. Sci. 1(2), pp. 111, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Evol. Comput. ![In: IEEE Trans. Evol. Comput. 24(3), pp. 467-478, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Cloud Appl. Comput. ![In: Int. J. Cloud Appl. Comput. 10(2), pp. 1-21, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Remote. Sens. ![In: Remote. Sens. 12(5), pp. 783, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Feodor F. Dragan |
An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 154, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Optim. Appl. ![In: Comput. Optim. Appl. 75(2), pp. 561-605, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Murat Çaliskan, Berk Anbaroglu |
Geo-MST: A geographical minimum spanning tree plugin for QGIS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoftwareX ![In: SoftwareX 12, pp. 100553, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Access ![In: IEEE Access 8, pp. 162209-162217, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Leonardo Gigli, Santiago Velasco-Forero, Beatriz Marcotegui |
On minimum spanning tree streaming for hierarchical segmentation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Pattern Recognit. Lett. ![In: Pattern Recognit. Lett. 138, pp. 155-162, 2020. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Intell. Inf. Syst. ![In: J. Intell. Inf. Syst. 55(3), pp. 587-606, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Lan Lin, Yixun Lin |
Optimality computation of the minimum stretch spanning tree problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 386, pp. 125502, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Lan Lin, Yixun Lin |
The Minimum Stretch Spanning Tree Problem for Hamming Graphs and Higher-Dimensional Grids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Interconnect. Networks ![In: J. Interconnect. Networks 20(1), pp. 2050004:1-2050004:15, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|