Given a vertex-weighted graph G = (V,E) and a set S ⊆ V , a subset feedback vertex set X is a set of the vertices of G such that the graph induced by V \ X has no cycle containing a vertex of S. The Subset Feedback Vertex Set problem takes as input G and S and asks for the subset feedback vertex set of minimum total weight. In contrast to the classical Feedback Vertex Set problem which is obtai...

We propose a simple and scalable method for soft community detection that makes use of both graph structures and vertex attributes. Our method is based on micro-clustering, which is a scalable and efficient clique-based method for detecting overlapping communities in unweighted graphs. We extend this method to graphs with vertex attributes so that we can make use of information supplied by vert...

Connected Vertex Cover is one of the classical problems of computer science, already mentioned in the monograph of Garey and Johnson [W.H. Freeman & Co., 1979]. Although the optimization and decision variants of finding connected vertex covers of minimum size or weight are well-studied, surprisingly there is no work on the enumeration or maximum number of minimal connected vertex covers of a gr...

The optimal value computation for turned-based stochastic games with reachability objectives, also known as simple stochastic games, is one of the few problems in NP ∩ coNP which are not known to be in P. However, there are some cases where these games can be easily solved, as for instance when the underlying graph is acyclic. In this work, we try to extend this tractability to several classes ...

We study the paramereteized complexity of the following connectivity problem. For a vertex subset U of a graph G, trees T1, . . . , Ts of G are completely independent spanning trees of U if each of them contains U , and for every two distinct vertices u, v ∈ U , the paths from u to v in T1, . . . , Ts are pairwise vertex disjoint except for end-vertices u and v. Then for a given s ≥ 2 and a par...

This paper proposes a method to detect corresponding vertex pairs between planar tessellation datasets. Applying an agglomerative hierarchical co-clustering, the method finds geometrically corresponding cell-set pairs from which corresponding vertex pairs are detected. Then, the map transformation is performed with the vertex pairs. Since these pairs are independently detected for each correspo...

A graph whose edges are labeled either as positive or negative is called a signed graph. A signed graph is said to be net-regular if every vertex has constant net-degree k, namely, the difference between the number of positive and negative edges incident with a vertex. In this paper, we analyze some properties of co-regular signed graphs which are net-regular signed graphs with the underlying g...

Vertex Pharmaceuticals Inc, in collaboration with Kissei Pharmaceutical Co Ltd, is developing VX-702, one of a series of second-generation, orally active p38 MAP kinase inhibitors, for the potential treatment of inflammation, rheumatoid arthritis and cardiovascular diseases. In June 2005, a phase II clinical trial of VX-702 was initiated in rheumatoid arthritis. In July 2006, Vertex was plannin...