On mixed connectivity certificates (Q1274334): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 17:55, 28 May 2024

scientific article

Language	Label	Description	Also known as
English	On mixed connectivity certificates	scientific article

Statements

scholarly article

0 references

On mixed connectivity certificates (English)

0 references

zbMATH Open document ID

0 references

10.1016/S0304-3975(98)00023-1

0 references

0 references

0 references

Sergio Rajsbaum

0 references

Theoretical Computer Science

0 references

publication date

12 January 1999

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

connectivity certificates

0 references

mixed connectivity

0 references

distributed algorithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for <i>k</i>-Vertex Connectivity

0 references

Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs

0 references

0 references

0 references

On sparse subgraphs preserving connectivity properties

0 references

0 references

The multi-tree approach to reliability in distributed networks

0 references

Über minimal n-fach zusammenhängende, unendliche Graphen und ein Extremalproblem. (On minimal n-fold connected infinite graphs and an extremal problem)

0 references

Grad und lokaler Zusammenhang in endlichen Graphen

0 references

0 references

A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph

0 references

Sub-linear distributed algorithms for sparse certificates and biconnected components

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1274334

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1274334&oldid=34211704"