Call routing and the ratcatcher (Q1330799): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Quickly excluding a forest / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Some simplified NP-complete graph problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph minors. X: Obstructions to tree-decomposition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graph minors. XI: Circuits on a surface / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A polynomial algorithm for the min-cut linear arrangement of trees / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01215352 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2019137761 / rank | |||
Normal rank | |||
Latest revision as of 08:33, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Call routing and the ratcatcher |
scientific article |
Statements
Call routing and the ratcatcher (English)
0 references
11 August 1994
0 references
call routing
0 references
routing tree
0 references
NP-hard
0 references
planar graph
0 references
polynomial algorithm
0 references
ratcatcher
0 references
branch-width
0 references
