1648 search results - page 8 / 330 » On the generation of bicliques of a graph |
TAGT
1994
Springer
15 years 1 months ago
1994
Springer
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
ISAAC
2009
Springer
15 years 4 months ago
2009
Springer
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the num...
COMBINATORICS
2002
14 years 9 months ago
2002
A sink-free orientation of a finite undirected graph is a choice of orientation
FLAIRS
2007
14 years 12 months ago
2007
We describe an algorithm and experiments for inference of edge replacement graph grammars. This method generates candidate recursive graph grammar productions based on isomorphic ...
TVCG
2012
13 years 1 days ago
2012
—We present a new approach for time-varying graph drawing that achieves both spatiotemporal coherence and multifocus+context visualization in a single framework. Our approach uti...