Sciweavers

280 search results - page 7 / 56
» New Algorithms for Enumerating All Maximal Cliques
Sort
View
DM
2007
57views more  DM 2007»
14 years 9 months ago
Triangulated neighborhoods in even-hole-free graphs
An even-hole-free graph is a graph that does not contain, as an induced subgraph, a chordless cycle of even length. A graph is triangulated if it does not contain any chordless cy...
Murilo Vicente Gonçalves da Silva, Kristina...
PKDD
2005
Springer
145views Data Mining» more  PKDD 2005»
15 years 2 months ago
A Correspondence Between Maximal Complete Bipartite Subgraphs and Closed Patterns
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...
Jinyan Li, Haiquan Li, Donny Soh, Limsoon Wong
SPIRE
2010
Springer
14 years 7 months ago
Counting and Verifying Maximal Palindromes
Abstract. A palindrome is a symmetric string that reads the same forward and backward. Let Pals(w) denote the set of maximal palindromes of a string w in which each palindrome is r...
Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayu...
86
Voted
BMCBI
2006
95views more  BMCBI 2006»
14 years 9 months ago
XcisClique: analysis of regulatory bicliques
Background: Modeling of cis-elements or regulatory motifs in promoter (upstream) regions of genes is a challenging computational problem. In this work, set of regulatory motifs si...
Amrita Pati, Cecilia Vasquez-Robinet, Lenwood S. H...
FSTTCS
2006
Springer
15 years 1 months ago
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
Sushmita Gupta, Venkatesh Raman, Saket Saurabh