Partitioning a graph in \(O(|A|\log_ 2|V|)\) (Q1161293): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: DBLP publication ID (P1635): journals/tcs/CardonC82, #quickstatements; #temporary_batch_1731468600454 |
||
(One intermediate revision by one other user not shown) | |||
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 | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/tcs/CardonC82 / rank | |||
Normal rank |
Latest revision as of 05:44, 13 November 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