4865 search results - page 52 / 973 » The Complexity of Graph Connectivity |
ESA
2010
Springer
13 years 11 months ago
2010
Springer
In this paper, we show that for an n-vertex graph G of genus g, the edge expansion of G can be determined in time nO(g2 ) . We show that the same is true for various other similar ...
FOIKS
2008
Springer
2008
Springer
Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
13 years 11 months ago
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arg...
IV
2002
IEEE
14 years 3 months ago
2002
IEEE
We apply fillets — smoothing of sharp angles at the joints — between the connections and nodes of graph-like diagrams. In situations where the graph layout is constrained, e....
ICALP
2007
Springer
14 years 4 months ago
2007
Springer
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertic...
COCOON
2006
Springer
14 years 2 days ago
2006
Springer
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...