Sciweavers

20 search results - page 1 / 4
» Bipartite Permutation Graphs Are Reconstructible
Sort
View
IPL
2007
130views more  IPL 2007»
13 years 4 months ago
Linear structure of bipartite permutation graphs and the longest path problem
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...
Ryuhei Uehara, Gabriel Valiente
ISAAC
2009
Springer
150views Algorithms» more  ISAAC 2009»
13 years 10 months ago
Random Generation and Enumeration of Bipartite Permutation Graphs
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...
Toshiki Saitoh, Yota Otachi, Katsuhisa Yamanaka, R...
COCOA
2010
Springer
13 years 2 months ago
Bipartite Permutation Graphs Are Reconstructible
Masashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara
ARSCOM
2007
115views more  ARSCOM 2007»
13 years 4 months ago
Minimal Universal Bipartite Graphs
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
Vadim V. Lozin, Gábor Rudolf
WG
2010
Springer
13 years 2 months ago
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time
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...
Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov...