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 30 matches
- 2024
- Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Eike Niehs:
Edge Sparsification for Geometric Tour Problems. Comput. Geom. Topol. 3(1): 1:1-1:23 (2024) - Zhen Su, Yang Liu, Jürgen Kurths, Henning Meyerhenke:
Generic network sparsification via degree- and subgraph-based edge sampling. Inf. Sci. 679: 121096 (2024) - 2023
- Yang P. Liu:
Vertex Sparsification for Edge Connectivity in Polynomial Time. ITCS 2023: 83:1-83:15 - Zhen Su, Jürgen Kurths, Henning Meyerhenke:
Network Sparsification via Degree- and Subgraph-based Edge Sampling. CoRR abs/2301.03032 (2023) - 2022
- Haozhao Wang, Song Guo, Zhihao Qu, Ruixuan Li, Ziming Liu:
Error-Compensated Sparsification for Communication-Efficient Decentralized Training in Edge Environment. IEEE Trans. Parallel Distributed Syst. 33(1): 14-25 (2022) - Zhen Su, Jürgen Kurths, Henning Meyerhenke:
Network Sparsification via Degree- and Subgraph-based Edge Sampling. ASONAM 2022: 9-16 - Lei Lei, Yaxiong Yuan, Yang Yang, Yu Luo, Lina Pu, Symeon Chatzinotas:
Sparsification and Optimization for Energy-Efficient Federated Learning in Wireless Edge Networks. GLOBECOM 2022: 3071-3076 - Ema Becirovic, Zheng Chen, Erik G. Larsson:
Optimal MIMO Combining for Blind Federated Edge Learning with Gradient Sparsification. SPAWC 2022: 1-5 - Ema Becirovic, Zheng Chen, Erik G. Larsson:
Optimal MIMO Combining for Blind Federated Edge Learning with Gradient Sparsification. CoRR abs/2203.12957 (2022) - 2021
- Yu Chen, Sanjeev Khanna, Ansh Nagda:
Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries. ICALP 2021: 53:1-53:21 - Guihong Wan, Haim Schweitzer:
Edge Sparsification for Graphs via Meta-Learning. ICDE 2021: 2733-2738 - Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz:
Vertex Sparsification for Edge Connectivity. SODA 2021: 1206-1225 - Yu Chen, Sanjeev Khanna, Ansh Nagda:
Sublinear Time Hypergraph Sparsification via Cut and Edge Sampling Queries. CoRR abs/2106.10386 (2021) - 2020
- Shiqi Li, Qi Qi, Jingyu Wang, Haifeng Sun, Yujian Li, F. Richard Yu:
GGS: General Gradient Sparsification for Federated Learning in Edge Computing*. ICC 2020: 1-7 - Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz:
Vertex Sparsification for Edge Connectivity. CoRR abs/2007.07862 (2020) - Yang P. Liu:
Vertex Sparsification for Edge Connectivity in Polynomial Time. CoRR abs/2011.15101 (2020) - 2019
- Batjargal Dolgorsuren, Kifayat-Ullah Khan, Young-Koo Lee:
EM-FGS: Graph sparsification via faster semi-metric edges pruning. Appl. Intell. 49(10): 3731-3748 (2019) - 2018
- Zhuo Feng:
Similarity-aware spectral sparsification by edge filtering. DAC 2018: 152:1-152:6 - 2017
- Zhuo Feng:
Similarity-Aware Spectral Sparsification by Edge Filtering. CoRR abs/1711.05135 (2017) - 2016
- Kevin Eckenhoff, Liam Paull, Guoquan Huang:
Decoupled, consistent node removal and edge sparsification for graph-based SLAM. IROS 2016: 3275-3282 - 2014
- Oren Salzman, Doron Shaharabani, Pankaj K. Agarwal, Dan Halperin:
Sparsification of motion-planning roadmaps by edge contraction. Int. J. Robotics Res. 33(14): 1711-1725 (2014) - Nicholas Carlevaris-Bianco, Ryan M. Eustice:
Conservative edge sparsification for graph SLAM node removal. ICRA 2014: 854-860 - 2013
- Nicholas Carlevaris-Bianco, Ryan M. Eustice:
Generic factor-based node marginalization and edge sparsification for pose-graph SLAM. ICRA 2013: 5748-5755 - Doron Shaharabani, Oren Salzman, Pankaj K. Agarwal, Dan Halperin:
Sparsification of motion-planning roadmaps by edge contraction. ICRA 2013: 4098-4105 - 2012
- Ashish Goel, Michael Kapralov, Ian Post:
Single pass sparsification in the streaming model with edge deletions. CoRR abs/1203.4900 (2012) - Doron Shaharabani, Oren Salzman, Pankaj K. Agarwal, Dan Halperin:
Sparsification of Motion-Planning Roadmaps by Edge Contraction. CoRR abs/1209.4463 (2012) - 2010
- Zhisu Zhu, Anthony Man-Cho So, Yinyu Ye:
Universal Rigidity and Edge Sparsification for Sensor Network Localization. SIAM J. Optim. 20(6): 3059-3081 (2010) - Fan Chung Graham, Wenbo Zhao:
A Sharp PageRank Algorithm with Applications to Edge Ranking and Graph Sparsification. WAW 2010: 2-14 - Wai Shing Fung, Nicholas J. A. Harvey:
Graph Sparsification by Edge-Connectivity and Random Spanning Trees. CoRR abs/1005.0265 (2010) - 1998
- David Eppstein, Zvi Galil, Giuseppe F. Italiano, Thomas H. Spencer:
Separator-Based Sparsification II: Edge and Vertex Connectivity. SIAM J. Comput. 28(1): 341-381 (1998)
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-09-22 09:10 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