220 search results - page 1 / 44 » Reconstruction Algorithm for Permutation Graphs |
WALCOM
2010
IEEE
13 years 9 months ago
2010
IEEE
IPL
2007
13 years 10 months ago
2007
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
ISAAC
2009
Springer
14 years 5 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
2006
13 years 11 months ago
2006
We consider the problem of permutation reconstruction, which is a variant of graph reconstruction. Given a permutation p of length n, we delete k of its entries in each possible w...
WG
2005
Springer
14 years 4 months ago
2005
Springer
This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That repr...