An algorithm for<i>K</i>-convex closure and an application (Q2752262): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q126246078, #quickstatements; #temporary_batch_1726341741784 |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q3995743 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A polynomial time algorithm for finding the prime factors of Cartesian- product graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recognizing median graphs in subquadratic time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Recognizing Cartesian graph bundles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Factoring cartesian‐product graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Edge-colorability of graph bundles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph multiplication / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q126246078 / rank | |||
Normal rank |
Latest revision as of 20:34, 14 September 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithm for<i>K</i>-convex closure and an application |
scientific article |
Statements
An algorithm for<i>K</i>-convex closure and an application (English)
0 references
21 April 2002
0 references
recognition algorithm
0 references
convex closure
0 references
complexity
0 references
Cartesian graph bundles
0 references