A linear algorithm for bipartition of biconnected graphs (Q911298): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(90)90189-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1997165382 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of partitioning graphs into connected subgraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4168622 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A homology theory for spanning tress of a graph / rank | |||
Normal rank | |||
Latest revision as of 14:06, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear algorithm for bipartition of biconnected graphs |
scientific article |
Statements
A linear algorithm for bipartition of biconnected graphs (English)
0 references
1990
0 references
linear algorithm
0 references
bipartition of biconnected graphs
0 references
depth-first search
0 references
