The (Σ + 1)-Edge-Connectivity Augmentation Problem Without Creating Multiple Edges of a Graph

Lecture Notes in Computer Science - Germany
doi 10.1007/3-540-44929-9_14
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

The Minimum Number of Edges and Vertices in a Graph With Edge Connectivity $N$ and $M$ $N$-Bonds

Bulletin of the American Mathematical Society
1974English

The Laplacian Quadratic Form and Edge Connectivity of a Graph

Electronic Journal of Linear Algebra
Number TheoryAlgebra
2015English

Creating a Room Connectivity Graph of a Building From Per-Room Sensor Units

2012English

The Shortest Path Problem for a Multiple Graph

Modeling and Analysis of Information Systems
2017English

The Conjugacy Problem for Graph Products With Finite Cyclic Edge Groups

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1993English

Edge Currents in the Absence of Edges

Physics Letters, Section A: General, Atomic and Solid State Physics
AstronomyPhysics
1999English

A Random Graph With a Subcritical Number of Edges

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1988English

A Local Structure Graph Model: Modeling Formation of Network Edges as a Function of Other Edges

Political Analysis
SociologyInternational RelationsPolitical Science
2019English

A Novel Efficient Graph Model for the Multiple Longest Common Subsequences (MLCS) Problem

Frontiers in Genetics
GeneticsMolecular Medicine
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy