Partitioning a Graph into Highly Connected Subgraphs-Reference-Cited by-全球学者库

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

Partitioning a Graph into Highly Connected Subgraphs

Published:2015-08-17 Issue:3 Volume:82 Page:322-333
ISSN:0364-9024
Container-title:Journal of Graph Theory
language:en
Short-container-title:J. Graph Theory

Author:

Borozan Valentin¹²,Ferrara Michael³,Fujita Shinya⁴,Furuya Michitaka⁵,Manoussakis Yannis¹,N Narayanan⁶,Stolee Derrick⁷

Affiliation:

1. L.R.I.,BÂT.490; UNIVERSITY PARIS 11 SUD; ORSAY CEDEX FRANCE

2. ALFRÉD RÉNYI INSTITUTE OF MATHEMATICS; HUNGARIAN ACADEMY OF SCIENCES; BUDAPEST HUNGARY

3. DEPARTMENT OF MATHEMATICAL AND STATISTICAL SCIENCES; UNIVERSITY OF COLORADO DENVER; DENVER COLORADO

4. INTERNATIONAL COLLEGE OF ARTS AND SCIENCES; YOKOHAMA CITY UNIVERSITY; KANAZAWA-KU YOKOHAMA JAPAN

5. DEPARTMENT OF MATHEMATICAL INFORMATION SCIENCE; TOKYO UNIVERSITY OF SCIENCE; SHINJUKU-KU TOKYO JAPAN

6. DEPARTMENT OF MATHEMATICS; INDIAN INSTITUTE OF TECHNOLOGY MADRAS; CHENNAI INDIA

7. DEPARTMENT OF MATHEMATICS; DEPARTMENT OF COMPUTER SCIENCE; IOWA STATE UNIVERSITY; AMES IOWA

Funder

Simons Foundation

Simons Foundation Collaboration

Japan Society for the Promotion of Science Grant-in-Aid for Young Scientists (B)

Grant-in-Aid for Scientific Research(C)

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Reference18 articles.

1. J. Akiyama M. Kano Factors and Factorizations of Graphs: Proof Techniques in Factor Theory 2011

2. What is the furthest graph from a hereditary property;Alon;Random Struct Algor,2008

3. On the editing distance of graphs;Axenovich;J Graph Theory,2008

4. Modern Graph Theory

5. Conditions for families of disjoint k-connected subgraphs in a graph;Ferrara;Discrete Math,2013

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

1. 2-Proper Partition of a Graph;Graphs and Combinatorics;2022-11-26

2. Highly connected subgraphs of graphs with given independence number;European Journal of Combinatorics;2018-05

3. Formal analysis of subnet-based failure recovery algorithm in wireless sensor and actor and network;Complex Adaptive Systems Modeling;2016-11-18

4. Highly Connected Subgraphs of Graphs with Given Independence Number (Extended Abstract);Electronic Notes in Discrete Mathematics;2016-10

全球学者库

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2023 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3