2125 search results - page 38 / 425 » On Graph Complexity |
144
Voted
WG
2009
Springer
15 years 9 months ago
2009
Springer
We present a fully dynamic algorithm that maintains three different representations of an interval graph: a minimal interval model of the graph, the PQ-tree of its maximal cliques...
151
Voted
CATS
2008
15 years 4 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
93
Voted
ISCAS
2006
IEEE
15 years 8 months ago
2006
IEEE
Synchronization in networks with different topolo- is shown that for typical systems only three main scenarios gies is studied. We show that for a large class of oscillators there ...
94
Voted
GC
2002
Springer
15 years 2 months ago
2002
Springer
It is shown that the Hilbert series of the face ring of a clique complex (equivalently, flag complex) of a graph G is, up to a factor, just a specialization of SG (x, y), the subg...
143
Voted
CC
2006
Springer
15 years 2 months ago
2006
Springer
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...