The complexity of testing whether a graph is a superconcentrator-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The complexity of testing whether a graph is a superconcentrator

Published:1981-01 Issue:4-5 Volume:13 Page:164-167
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Blum M.,Karp R.M.,Vornberger O.,Papadimitriu C.H.,Yannakakis M.

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference8 articles.

1. Flows in Networks;Ford,1962

2. Explicit construction of linear size superconcentrators;Gabber;Proc. 20th IEEE Symposium on Foundations of Computer Science,1979

3. On representations of subsets;Hall;J. London Math. Soc.,1935

4. An n52 algorithm for maximum matching in bipartite graphs;Hopcroft;SIAM J. Comput.,1973

5. Explicit construction of concentrators;Margulis;Problemy Peredachi Informatsü,1973

Cited by 41 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Building a Sybil-Resilient Digital Community Utilizing Trust-Graph Connectivity;IEEE/ACM Transactions on Networking;2021-10

2. Distributed Graph Clustering and Sparsification;ACM Transactions on Parallel Computing;2019-12-05

3. Tighter spectral bounds for the cut size, based on Laplacian eigenvectors;Linear Algebra and its Applications;2019-07

4. Finding Critical Links for Closeness Centrality;INFORMS Journal on Computing;2019-04

5. Sybil-Resilient Conductance-Based Community Growth;Computer Science – Theory and Applications;2019

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP