Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs (Q3439135): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.endm.2004.03.018 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2003625473 / rank | |||
Normal rank | |||
Revision as of 22:10, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs |
scientific article |
Statements
Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs (English)
0 references
29 May 2007
0 references
(minimum) all-ones problem
0 references
graph-theoretic algorithm
0 references
linear time
0 references
