2007
DOI: 10.1134/s1064230707010108
|View full text |Cite
|
Sign up to set email alerts
|

Chain sequences with ordered enclosing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(6 citation statements)
references
References 2 publications
0
6
0
Order By: Relevance
“…This algorithm has computing complexity O(|E| 2 ). However, there exists non-recursive approach with computing complexity O(|V| • log |E|) [28].…”
Section: Theorem 2 ([19]mentioning
confidence: 99%
“…This algorithm has computing complexity O(|E| 2 ). However, there exists non-recursive approach with computing complexity O(|V| • log |E|) [28].…”
Section: Theorem 2 ([19]mentioning
confidence: 99%
“…Definition 11. [19] Let minimal cardinality ordered sequence of edge-disjoint OEchains for plane graph G be called Eulerian cover with ordered enclosing (Eulerian OE-cover).…”
Section: Oe-routes For Any Plane Graphsmentioning
confidence: 99%
“…According to Listing-Luke theorem, the lower bound cannot be less than k. This bound is reached for bridgeless graphs with at least one odd degree vertex adjacent to the outer face (see algorithm OECover). There is an algorithm in [19] constructing the ordered sequence of OE-chains and covering bridgeless graphs by not more than k + 1 chains. Routes realizing this cover contain additional edges, those between the end of a current chain and the beginninhg of the next one.…”
Section: Oe-routes For Any Plane Graphsmentioning
confidence: 99%
See 2 more Smart Citations