Improved master theorems for divide-and-conquer recurrences
Journal of the ACM (JACM)
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Profile minimization on triangulated triangles
Discrete Mathematics
Divider-based algorithms for hierarchical tree partitioning
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
On the profile of the corona of two graphs
Information Processing Letters
On the interval completion of chordal graphs
Discrete Applied Mathematics
Interval completion with few edges
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
The profile of the Cartesian product of graphs
Discrete Applied Mathematics
On the interval completion of chordal graphs
Discrete Applied Mathematics
A new matrix bandwidth reduction algorithm
Operations Research Letters
| Hi-index | 0.00 |
The profile minimization problem is to find a one-to-one function $f$ from the vertex set $V(G)$ of a graph $G$ to the set of all positive integers such that $\sum_{x \in V(G)} \{f(x) - \min_{y \in N[x]} f(y)\}$ is as small as possible, where $N[x] = \{x\} \cup \{ y:y \mbox{ is adjacent to } x\}$ is the closed neighborhood of $x$ in $G$. This paper gives an $O(n^{1.722})$ time algorithm for the problem in a tree of $n$ vertices.