1,722,590 research outputs found

    Blair, D.

    No full text

    Improved Parameterized Complexity of Happy Set Problems

    Full text link
    We present fixed-parameter tractable (FPT) algorithms for two problems, Maximum Happy Set (MaxHS) and Maximum Edge Happy Set (MaxEHS)--also known as Densest k-Subgraph. Given a graph GG and an integer kk, MaxHS asks for a set SS of kk vertices such that the number of happy vertices\textit{happy vertices} with respect to SS is maximized, where a vertex vv is happy if vv and all its neighbors are in SS. We show that MaxHS can be solved in time O(2mwmwk2V(G))\mathcal{O}\left(2^\textsf{mw} \cdot \textsf{mw} \cdot k^2 \cdot |V(G)|\right) and O(8cwk2V(G))\mathcal{O}\left(8^\textsf{cw} \cdot k^2 \cdot |V(G)|\right), where mw\textsf{mw} and cw\textsf{cw} denote the modular-width\textit{modular-width} and the clique-width\textit{clique-width} of GG, respectively. This resolves the open questions posed in literature. The MaxEHS problem is an edge-variant of MaxHS, where we maximize the number of happy edges\textit{happy edges}, the edges whose endpoints are in SS. In this paper we show that MaxEHS can be solved in time f(nd)V(G)O(1)f(\textsf{nd})\cdot|V(G)|^{\mathcal{O}(1)} and O(2cdk2V(G))\mathcal{O}\left(2^{\textsf{cd}}\cdot k^2 \cdot |V(G)|\right), where nd\textsf{nd} and cd\textsf{cd} denote the neighborhood diversity\textit{neighborhood diversity} and the cluster deletion number\textit{cluster deletion number} of GG, respectively, and ff is some computable function. This result implies that MaxEHS is also fixed-parameter tractable by twin cover number\textit{twin cover number}

    Going Beyond Counting First Authors in Author Co-citation Analysis

    Full text link
    The present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
    corecore