Partitioning a graph in \(O(|A|\log_ 2|V|)\) (Q1161293): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: DBLP publication ID (P1635): journals/tcs/CardonC82, #quickstatements; #temporary_batch_1731468600454
 
(5 intermediate revisions by 5 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q61677993 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(82)90016-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2002279082 / 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: 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 04: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

    Identifiers