A simple algorithm to detect balance in signed graphs (Q1170207): 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 / OpenAlex ID | |||
| Property / OpenAlex ID: W1995536165 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the computational power of pushdown automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Consistency in marked digraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Consistent graphs with signed points / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the notion of balance of a signed graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Counting balanced signed graphs using marked graphs / rank | |||
Normal rank | |||
Latest revision as of 16:10, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple algorithm to detect balance in signed graphs |
scientific article |
Statements
A simple algorithm to detect balance in signed graphs (English)
0 references
1980
0 references
balanced signed graph
0 references
graph algorithm
0 references
fundamental cycles
0 references
spanning tree
0 references
