Results 111 to 120 of about 5,251,465 (203)

Tits alternatives for graph products

open access: yes, 2015
We discuss various types of Tits Alternative for subgroups of graph products of groups, and prove that, under some natural conditions, a graph product of groups satisfies a given form of Tits Alternative if and only if each vertex group satisfies this ...
Antolin, Yago, Minasyan, Ashot
core   +1 more source

Graph Pattern Matching: From Intractable to Polynomial Time [PDF]

open access: yes, 2010
Graph pattern matching is typically defined in terms of sub-graph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often too restrictive to characterize patterns in emerging applications. We propose
Li, Jianzhong   +5 more
core  

Distributed Graph Simulation: Impossibility and Possibility [PDF]

open access: yes, 2014
This paper studies fundamental problems for distributed graph simulation. Given a pattern query Q and a graph G that is fragmented and distributed, a graph simulation algorithm A is to compute the matches Q(G) of Q in G.
Wang, Xin   +3 more
core  

Estimating population size via line graph reconstruction. [PDF]

open access: yesAlgorithms Mol Biol, 2013
Halldórsson BV, Blokh D, Sharan R.
europepmc   +1 more source

Decomposing Berge graphs and detecting balanced skew partitions [PDF]

open access: yes
We prove that the problem of deciding whether a graph has a balanced skew partition is NP-hard. We give an O(n9)-time algorithm for the same problem restricted to Berge graphs.
Nicolas Trotignon
core  

Home - About - Disclaimer - Privacy