1163 search results - page 10 / 233 » Embedding into Bipartite Graphs |
CMOT
2004
13 years 7 months ago
2004
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
LATIN
2000
Springer
13 years 11 months ago
2000
Springer
We look at the minimal size of a maximal matching in general, bipartite and
COCO
2010
Springer
13 years 5 months ago
2010
Springer
An even cycle in a graph is called nice by Lov
WG
2010
Springer
13 years 6 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
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...