Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 153 matches
- 2023
- I-Cheng Liao, Hsueh-I Lu:
A Simple 2-Approximation for Maximum-Leaf Spanning Tree. Int. J. Found. Comput. Sci. 34(7): 795-805 (2023) - Wenbiao Zhao, Runxin Li, Zhenhong Shang:
Multilabel Classifier Chains Algorithm Based on Maximum Spanning Tree and Directed Acyclic Graph. Int. J. Inf. Technol. Syst. Approach 16(3): 1-21 (2023) - Edward Khairutdinovich Gimadi, Alexandr A. Shtepa:
The Problem of Finding Several Given Diameter Spanning Trees of Maximum Total Weight in a Complete Graph. AIST 2023: 341-348 - A. Karim Abu-Affash, Paz Carmi, Meytal Maman:
Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees. WALCOM 2023: 71-77 - I-Cheng Liao, Hsueh-I Lu:
A Simple 2-Approximation for Maximum-Leaf Spanning Tree. CoRR abs/2303.03125 (2023) - 2022
- Xianbin Zhu, Wenjun Li, Yongjie Yang, Jian-Xin Wang:
Erratum to: Incremental algorithms for the maximum internal spanning tree problem. Sci. China Inf. Sci. 65(10) (2022) - Xianyue Li, Ruowang Yang, Heping Zhang, Zhao Zhang:
Partial inverse maximum spanning tree problem under the Chebyshev norm. J. Comb. Optim. 44(5): 3331-3350 (2022) - Gopika Sharma, Arti Pandey, Michael C. Wigal:
Algorithms for maximum internal spanning tree problem for some graph classes. J. Comb. Optim. 44(5): 3419-3445 (2022) - Ahmad Biniaz:
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs. J. Graph Algorithms Appl. 26(2): 209-224 (2022) - Christopher Thomas Ryan, Robert L. Smith:
A greedy algorithm for finding maximum spanning trees in infinite graphs. Oper. Res. Lett. 50(6): 655-659 (2022) - Xiaoyun Xia, Zhengxin Huang, Xue Peng, Zefeng Chen, Yi Xiang:
Performance analysis of evolutionary algorithm for the maximum internal spanning tree problem. J. Supercomput. 78(9): 11949-11973 (2022) - A. Karim Abu-Affash, Paz Carmi, Meytal Maman:
Piercing Diametral Disks Induced by Edges of Maximum Spanning Tree. CoRR abs/2209.11260 (2022) - Christoph Brause, Jochen Harant, Florian Hörsch, Samuel Mohr:
Spanning trees of smallest maximum degree in subdivisions of graphs. CoRR abs/2210.04669 (2022) - 2021
- Xianbin Zhu, Wenjun Li, Yongjie Yang, Jianxin Wang:
Incremental algorithms for the maximum internal spanning tree problem. Sci. China Inf. Sci. 64(5) (2021) - Javier Alonso, Pedro Martín:
Maximum Spanning Trees in Normed Planes. Graphs Comb. 37(4): 1385-1403 (2021) - Xingfu Li, Daming Zhu, Lusheng Wang:
A 43-approximation algorithm for the Maximum Internal Spanning Tree Problem. J. Comput. Syst. Sci. 118: 131-140 (2021) - Xianyue Li, Ruowang Yang, Heping Zhang, Zhao Zhang:
Capacitated Partial Inverse Maximum Spanning Tree Under the Weighted l∞ -norm. COCOA 2021: 389-399 - Xiaoxin Wang, Xuyun Wen, Kai Ma, Daoqiang Zhang:
A Multilayer Maximum Spanning Tree Kernel For Brain Networks. ISBI 2021: 1582-1585 - Ahmad Biniaz:
Better Approximation Algorithms for Maximum Weight Internal Spanning Trees in Cubic Graphs and Claw-Free Graphs. WALCOM 2021: 260-271 - Stefan Grünewald:
Maximum Spanning Trees Are Invariant to Temperature Scaling in Graph-based Dependency Parsing. CoRR abs/2106.08159 (2021) - Gopika Sharma, Arti Pandey, Michael C. Wigal:
Algorithms for Maximum Internal Spanning Tree Problem for Some Graph Classes. CoRR abs/2112.02248 (2021) - 2020
- Xianyue Li, Zhao Zhang, Ruowang Yang, Heping Zhang, Ding-Zhu Du:
Approximation algorithms for capacitated partial inverse maximum spanning tree problem. J. Glob. Optim. 77(2): 319-340 (2020) - Khawla Asmi, Dounia Lotfi, Mohamed El Marraki:
Overlapping community detection based on the union of all maximum spanning trees. Libr. Hi Tech 38(2): 276-292 (2020) - Fernanda Couto, Luís Felipe I. Cunha:
Hardness and efficiency on minimizing maximum distances in spanning trees. Theor. Comput. Sci. 838: 168-179 (2020) - Fatima Zahra Benabdallah, Ahmed Drissi El Maliani, Dounia Lotfi, Mohammed El Hassouni:
Analysis of the Over-Connectivity in Autistic Brains Using the Maximum Spanning Tree: Application on the Multi-Site and Heterogeneous ABIDE Dataset. WINCOM 2020: 1-7 - Enrique G. Alvarado, Bala Krishnamoorthy, Kevin R. Vixie:
The Maximum Distance Problem and Minimal Spanning Trees. CoRR abs/2004.07323 (2020) - Ahmad Biniaz:
Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs. CoRR abs/2006.12561 (2020) - Ahmad Biniaz:
Improved approximation ratios for two Euclidean maximum spanning tree problems. CoRR abs/2010.03870 (2020) - 2019
- Xiaoyang Han, Xiangru Meng, Qiao-yan Kang, Yuze Su:
Survivable Virtual Network Link Shared Protection Method Based on Maximum Spanning Tree. IEEE Access 7: 92137-92150 (2019) - Zhi-Zhong Chen, Guohui Lin, Lusheng Wang, Yong Chen, Dan Wang:
Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem. Algorithmica 81(11-12): 4167-4199 (2019)
skipping 123 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-10 12:08 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint