[PDF] Top 20 Maximum Motif Problem in Vertex-Colored Graphs
Has 10000 "Maximum Motif Problem in Vertex-Colored Graphs" found on our website. Below are the top 20 most common "Maximum Motif Problem in Vertex-Colored Graphs".
Maximum Motif Problem in Vertex-Colored Graphs
... the problem, where the parameter is the size of the ...the problem. 1 Introduction Searching for motifs in graphs has become a crucial problem in the analysis of biological ... Voir le document complet
16
Weak pattern matching in colored graphs: Minimizing the number of connected components
... stephane.vialette@lri.fr In the context of metabolic network analysis, Lacroix et ...the problem of finding occurrences of motifs in vertex-colored graphs, where a motif ... Voir le document complet
13
A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs
... the problem on other ...note in [ 7 ], the GRG solver does not guarantee the global opti- mal ...value. In each one of these successive re-runs, we tested the algorithm on 1000 random different ... Voir le document complet
14
Acyclic Coloring of Graphs of Maximum Degree $\Delta$
... works in a greedy way: at any step, we suppose that we have colored a certain number of vertices in an acyclic ...consists in taking arbitrarily an uncolored vertex u, and depending on ... Voir le document complet
9
Robust maximum weighted independent-set problems on interval graphs
... interval graphs; independent set; dynamic ...interval graphs [6, 9, 11, ...a maximum weighted independent-set problem (MWIS) where a weight is assigned to each vertex of the interval ... Voir le document complet
7
Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs
... contribution In this article, we mainly deal with complexity and approximability issues for MinCVC in particular classes of ...connected vertex covers (Section ...polynomial in chordal ... Voir le document complet
22
Pk partition problem and related problems in bipartite graphs
... partition problem (denoted by Mink- PathPartition ) and the maximum P k packing problem (MaxP k Packing in ...the vertex set of a graph G = (V, E) into the smallest number of paths such ... Voir le document complet
12
Maximum Independent Sets in Subcubic Graphs: New Results
... of graphs where forbidden induced subgraphs contain arbitrarily large chordless ...Clearly, in this case the set of forbidden induced subgraphs must be ...degree graphs a solution of this type is ... Voir le document complet
21
The probabilistic minimum vertex covering problem
... ted in order to study the realisti per- forman es of the three strategies ...generated graphs of orders n ∈ {14, 15, 16} , forty graphs per order, in the following way: for ea h graph, a ... Voir le document complet
16
Complexity issues in Vertex-Colored Graph Pattern Matching
... Min-CC problem is fixed-parameter tractable Let G be a graph and k be a positive ...Min-CC problem, where M is a motif of size ...M in G, say V ⊆ V(G), that results in a minimum number ... Voir le document complet
34
Computing maximum cliques in B 2 EPG graphs
... EPG graphs, introduced by Golumbic et al. in 2009, are edge-intersection graphs of paths on an or- thogonal ...EPG graphs where the path on the grid associated to each vertex has at ... Voir le document complet
16
Finding disjoint paths on edge-colored graphs: more tractability results
... The problem of finding the maximum number of vertex-disjoint uni-color paths in an edge-colored graph (called MaxCDP) has been recently introduced in literature, motivated by ... Voir le document complet
15
Analysis and Comparison of Three Algorithms for the Vertex Cover Problem on Large Graphs with Low Memory Capacities
... for Vertex Covering. Many algorithms have been proposed for the vertex cover ...a vertex of maximum degree and delete this vertex and its incident edges from the graph, until all edges ... Voir le document complet
19
On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs
... the problem in the case when H = S 1,j,k ...the problem can be solved for G by the rst part of the ...the problem can be solved for G 0 by induction on s ...vertices in [S] is bounded ... Voir le document complet
13
Upper and lower bounds for finding connected motifs in vertex-colored graphs
... of maximum degree three. PROOF. Graph Motif is clearly in ...NP-complete problem 3-SAT ...The problem remains hard even if each variable appears in at most three clauses and each ... Voir le document complet
24
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
... a motif occurs in a ω-boundaried graph A can be determined from inv(A) in time linear in the size of the ...ω-boundaried graphs corresponding to the nodes of the ω parse ...∅. In ... Voir le document complet
12
Complexity of Unique (Optimal) Solutions in Graphs: Vertex Cover and Domination
... needed in the ...decision problem is of the type “Given an instance I and a prop- erty PR on I, is PR true for I?”, and has only two solutions, “yes” or ...decision problem π1 to a decision ... Voir le document complet
25
Maximum independent sets in (pyramid, even hole)-free graphs
... a maximum weighted independent set in an (even-hole, pyramid)-free ...pyramid in an even-hole-free graphs places significant restrictions on its ...The graphs seems to ”organize itself” ... Voir le document complet
31
Vertex partitions of ($C 3 , C 4 , C 6$) -free planar graphs
... graph in C that is not (0, 6)-colorable and is minimal according to ...every vertex v, the degree of v in G is denoted by ...type in a face, we will always count twice the edges that are only ... Voir le document complet
12
The maximum saving partition problem
... graph. In this case, our problem is a node coloring problem, in which the cost of a legal coloring is the sum of costs of its color classes as prescribed by f ... Voir le document complet
10
Sujets connexes