1163 search results - page 14 / 233 » Embedding into Bipartite Graphs |
105
click to vote
DM
1998
15 years 3 months ago
1998
We characterize the edge-signed graphs in which every 'significant' positive closed walk (or combination of walks) has even length, under seven different criteria for si...
134
Voted
ISCAS
1999
IEEE
15 years 8 months ago
1999
IEEE
The bigraph crossing problem, embedding the two node sets of a bipartite graph G = V0;V1;E along two parallel lines so that edge crossings are minimized, has application to placeme...
149
Voted
SIAMDM
2010
15 years 2 months ago
2010
Let s < t be two fixed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n = k(s + t), which ensure t...
116
Voted
KES
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. To find hidden features of co-authoring relationships, we focused on drawing techniques for bipartite graphs. We previously developed a drawing method called "anchor...
126
click to vote
GBRPR
2007
Springer
15 years 10 months ago
2007
Springer
In the field of structural pattern recognition graphs constitute a very common and powerful way of representing patterns. In contrast to string representations, graphs allow us to ...