Partitioning a graph in \(O(|A|\log_ 2|V|)\) (Q1161293): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the computational power of pushdown automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Efficient Algorithm for Graph Isomorphism / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4045961 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5525259 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The graph isomorphism disease / rank | |||
Normal rank |
Revision as of 14:00, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Partitioning a graph in \(O(|A|\log_ 2|V|)\) |
scientific article |
Statements
Partitioning a graph in \(O(|A|\log_ 2|V|)\) (English)
0 references
1982
0 references