Schematization of networks (Q1776896): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Testing Homotopy for paths in the plane / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4157686 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3154375 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3043714 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4411377 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient Algorithms for Geometric Graph Search Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3024757 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Single bend wiring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends / rank | |||
Normal rank | |||
Latest revision as of 11:21, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Schematization of networks |
scientific article |
Statements
Schematization of networks (English)
0 references
12 May 2005
0 references
An efficient approach to compute schematized maps is described. The proposed algorithm uses a combinatorial approach and gives a correct solution if one exists. Several experimental results showing the quality of the output are also presented.
0 references
schematized map
0 references
topological equivalence
0 references
Visualization
0 references
Homotopy
0 references
numerical examples
0 references
algorithm
0 references
