On finding an ear decomposition of an undirected graph distributively (Q2390301): 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/j.ipl.2004.04.004 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2066521362 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3883524 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Depth-First Search and Linear Graph Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some remarks on distributed depth-first search. / rank | |||
Normal rank | |||
Latest revision as of 20:02, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On finding an ear decomposition of an undirected graph distributively |
scientific article |
Statements
On finding an ear decomposition of an undirected graph distributively (English)
0 references
21 July 2009
0 references
ear decomposition
0 references
distributed algorithms
0 references
communication network
0 references
graph algorithms
0 references
