Sciweavers

132 search results - page 1 / 27
» A Simple Test for Interval Graphs
Sort
View
ISAAC
1992
Springer
125views Algorithms» more  ISAAC 1992»
14 years 18 days ago
A Simple Test for the Consecutive Ones Property
A (0,1)-matrix satisfies the consecutive ones property if there exists a column permutation such that the ones in each row of the resulting matrix are consecutive. Booth and Lueke...
Wen-Lian Hsu
ECCC
2007
124views more  ECCC 2007»
13 years 8 months ago
Testing Hereditary Properties of Non-Expanding Bounded-Degree Graphs
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
Artur Czumaj, Asaf Shapira, Christian Sohler
TCS
2010
13 years 3 months ago
On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs
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...
Mauro Mezzini
ESA
2005
Springer
131views Algorithms» more  ESA 2005»
14 years 2 months ago
Computing Common Intervals of K Permutations, with Applications to Modular Decomposition of Graphs
We introduce a new way to compute common intervals of K permutations based on a very simple and general notion of generators of common intervals. This formalism leads to simple an...
Anne Bergeron, Cedric Chauve, Fabien de Montgolfie...