Name
Title | ||
|---|---|---|
Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract) |
Abstract | ||
|---|---|---|
On the Internet, there are advertisements (ads) of different kinds: image, text, video and other specially marked objects that are distinct from the underlying content of the page. There is an industry behind the management of such ads, and they face ... |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-70575-8_25 | ICALP |
Keywords | Field | DocType |
polynomial time,computational complexity,wireless network | Graph center,Discrete mathematics,Combinatorics,Vertex-transitive graph,Metric k-center,Graph power,Graph labeling,Distance,Time complexity,Mathematics,Edge-graceful labeling | Conference |
Citations | PageRank | References |
11 | 0.61 | 17 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiří Fiala | 1 | 300 | 24.05 |
| Petr A. Golovach | 2 | 766 | 83.25 |
| Jan Kratochvíl | 3 | 1751 | 151.84 |