175 search results - page 6 / 35 » max-cut and Containment Relations in Graphs |
ICWSM
2009
13 years 5 months ago
2009
Events and stories can be characterized by a set of descriptive, collocated keywords. Intuitively, documents describing the same event will contain similar sets of keywords, and t...
TCS
2010
13 years 2 months ago
2010
In this paper we show that the problem of finding a chordless path between a vertex s and a vertex t containing a vertex v remains NP-complete in bipartite graphs, thereby strengt...
EJC
2010
13 years 7 months ago
2010
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an exp...
GG
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
DM
2011
13 years 2 months ago
2011
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...