NDLI logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Journal of Systems Science and Complexity
  2. Journal of Systems Science and Complexity : Volume 23
  3. Journal of Systems Science and Complexity : Volume 23, Issue 1, February 2010
  4. Testing k-edge-connectivity of digraphs
Loading...

Please wait, while we are loading the content...

Journal of Systems Science and Complexity : Volume 30
Journal of Systems Science and Complexity : Volume 29
Journal of Systems Science and Complexity : Volume 28
Journal of Systems Science and Complexity : Volume 27
Journal of Systems Science and Complexity : Volume 26
Journal of Systems Science and Complexity : Volume 25
Journal of Systems Science and Complexity : Volume 24
Journal of Systems Science and Complexity : Volume 23
Journal of Systems Science and Complexity : Volume 23, Issue 6, December 2010
Journal of Systems Science and Complexity : Volume 23, Issue 5, October 2010
Journal of Systems Science and Complexity : Volume 23, Issue 4, August 2010
Journal of Systems Science and Complexity : Volume 23, Issue 3, June 2010
Journal of Systems Science and Complexity : Volume 23, Issue 2, April 2010
Journal of Systems Science and Complexity : Volume 23, Issue 1, February 2010
Special Issue for some new progress made by AMSS and Kyoto University on mathematical methods for informatics, engineering and management
Nonparametric approach to identifying NARX systems
Performance analysis of optimal channel estimation and multiuser detection in a randomly-spread CDMA channel
Consensus control for leader-following multi-agent systems with measurement noises
Systematic design of single carrier overlap frequency domain equalization
Fuzzy-based network bandwidth design under demand uncertainty
A combinatorial aspect of a discrete-time semi-infinite Lotka-Volterra equation
The conditional diagnosability of shuffle-cubes
Testing k-edge-connectivity of digraphs
On the observability and detectability of linear stochastic systems with Markov jumps and multiplicative noise
Bayesian image superresolution and hidden variable modeling
Ergodicity of linear SPDE driven by Lévy noise
Determinant solutions of the nonautonomous discrete Toda equation associated with the deautonomized discrete KP hierarchy
Two-scale finite element Green’s function approximations with applications to electrostatic potential computation
A weighted product method for bidding strategies in multi-attribute auctions
Journal of Systems Science and Complexity : Volume 22
Journal of Systems Science and Complexity : Volume 21
Journal of Systems Science and Complexity : Volume 20
Journal of Systems Science and Complexity : Volume 19

Similar Documents

...
Distributed quantized consensus for agents on directed networks

Article

...
Removable ears of 1-extendable graphs

Article

...
Distributed high-gain attitude synchronization using rotation vectors

Article

...
Complex systems in sports: Introduction to the special issue

Article

...
On the algorithmic complexity of static structures

Article

...
Complexity analysis of network-based dynamical systems

Article

...
Event-triggered average-consensus of multi-agent systems with weighted and direct topology

Article

...
Stochastic synchronization of circadian rhythms

Article

...
Signal estimation with binary-valued sensors

Article

Testing k-edge-connectivity of digraphs

Content Provider SpringerLink
Author Yoshida, Yuichi Ito, Hiro
Copyright Year 2010
Abstract This paper presents an algorithm that tests whether a given degree-bounded digraph is k-edge-connected or ɛ-far from k-edge-connectivity. This is the first testing algorithm for k-edgeconnectivity of digraphs whose running time is independent of the number of vertices and edges. A digraph of n vertices with degree bound d is ɛ-far from k-edge-connectivity if at least ɛdn edges have to be added or deleted to make the digraph k-edge-connected, preserving the degree bound. Given a constant error parameter ɛ and a degree bound d, our algorithm always accepts all k-edge-connected digraphs and rejects all digraphs that is ɛ-far from k-edge-connectivity with probability at least 2/3. It runs in $$ O\left( {d\left( {\frac{c} {{\varepsilon d}}} \right)^k log\frac{1} {{\varepsilon d}}O} \right) $$ (c > 1 is a constant) time when input digraphs are restricted to be (k-1)-edge connected and runs in $$ O\left( {d\left( {\frac{{ck}} {{\varepsilon d}}} \right)^k log\frac{k} {{\varepsilon d}}O} \right) $$ (c > 1 is a constant) time for general digraphs.
Starting Page 91
Ending Page 101
Page Count 11
File Format PDF
ISSN 10096124
Journal Journal of Systems Science and Complexity
Volume Number 23
Issue Number 1
e-ISSN 15597067
Language English
Publisher Springer-Verlag
Publisher Date 2010-02-25
Publisher Place Berlin, Heidelberg
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword Digraph graph k-edge-connectivity property testing Statistics Statistical Physics, Dynamical Systems and Complexity Mathematics of Computing Operations Research/Decision Theory Systems Theory, Control
Content Type Text
Resource Type Article
Subject Information Systems
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
  • Chat with Us
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
I will try my best to help you...
Cite this Content
Loading...