Synthical
Activity
Favorites
Account
Folders
Feeds
From arXiv

# Fixed-Parameter Complexity of Minimum Profile Problemsself.__wrap_n=self.__wrap_n||(self.CSS&&CSS.supports("text-wrap","balance")?1:2);self.__wrap_b=(e,t,r)=>{let n=(r=r||document.querySelector([data-br="${e}"])).parentElement,a=e=>r.style.maxWidth=e+"px";r.style.maxWidth="";let s=n.clientWidth,i=n.clientHeight,l=s/2-.25,o=s+.5,u;if(s){for(a(l),l=Math.max(r.scrollWidth,l);l+1<o;)a(u=Math.round((l+o)/2)),n.clientHeight===i?o=u:l=u;a(o*t+s*(1-t))}r.__wrap_o||"undefined"!=typeof ResizeObserver&&(r.__wrap_o=new ResizeObserver(()=>{self.__wrap_b(0,+r.dataset.brr,r)})).observe(n)};self.__wrap_n!=1&&self.__wrap_b(":R12quuultfautta:",1) 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. Simplify Published on April 24, 2006 Copy BibTeX Loading... Summary There is no AI-powered summary yet, because we do not have a budget to generate summaries for all articles. 1. Buy subscription We will thank you for helping thousands of people to save their time at the top of the generated summary. If you buy our subscription, you will be able to summarize multiple articles. Pay$8
≈10 summaries
Pay \$32
≈60 summaries
2. Share on socials