Fixed-Parameter Complexity of Minimum Profile Problems

Details Fixed-Parameter Complexity of Minimum Profile Problems Fixed-Parameter Complexity of Minimum Profile Problems

2006-04-24

arxiv.org/abs/cs/0604095v1

Computer Science

Data Structures and Algorithms

Scientific paper

Let $G=(V,E)$ be a graph. An ordering of $G$ is a bijection $\alpha: V\dom \{1,2,..., |V|\}.$ For a vertex $v$ in $G$, its closed neighborhood is $N[v]=\{u\in V: uv\in E\}\cup \{v\}.$ The profile of an ordering $\alpha$ of $G$ is $\prf_{\alpha}(G)=\sum_{v\in V}(\alpha(v)-\min\{\alpha(u): u\in N[v]\}).$ The profile $\prf(G)$ of $G$ is the minimum of $\prf_{\alpha}(G)$ over all orderings $\alpha$ of $G$. It is well-known that $\prf(G)$ is the minimum number of edges in an interval graph $H$ that contains $G$ is a subgraph. Since $|V|-1$ is a tight lower bound for the profile of connected graphs $G=(V,E)$, the parametrization above the guaranteed value $|V|-1$ is of particular interest. We show that deciding whether the profile of a connected graph $G=(V,E)$ is at most $|V|-1+k$ is fixed-parameter tractable with respect to the parameter $k$. We achieve this result by reduction to a problem kernel of linear size.

Affiliated with

Also associated with

No associations

Rating

Fixed-Parameter Complexity of Minimum Profile Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fixed-Parameter Complexity of Minimum Profile Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fixed-Parameter Complexity of Minimum Profile Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-582860