Sciweavers

1395 search results - page 131 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
SWAT
2004
Springer
109views Algorithms» more  SWAT 2004»
15 years 9 months ago
Robust Subgraphs for Trees and Paths
Consider a graph problem which is associated with a parameter, for example, that of finding a longest tour spanning k vertices. The following question is natural: Is there a smal...
Refael Hassin, Danny Segev
TCS
2008
15 years 3 months ago
A simple transitive signature scheme for directed trees
Transitive signatures allow a signer to authenticate edges in a graph in such a way that anyone, given the public key and two signatures on adjacent edges (i, j) and (j, k), can c...
Gregory Neven
JCT
2007
107views more  JCT 2007»
15 years 3 months ago
Vertex-minors, monadic second-order logic, and a conjecture by Seese
We prove that one can express the vertex-minor relation on finite undirected graphs by formulas of monadic second-order logic (with no edge set quantification) extended with a p...
Bruno Courcelle, Sang-il Oum
NAACL
2007
15 years 5 months ago
Are Very Large N-Best Lists Useful for SMT?
This paper describes an efficient method to extract large n-best lists from a word graph produced by a statistical machine translation system. The extraction is based on the k sh...
Sasa Hasan, Richard Zens, Hermann Ney
AUTOMATICA
2004
91views more  AUTOMATICA 2004»
15 years 3 months ago
Comparing digital implementation via the bilinear and step-invariant transformations
From an analog system K, digital systems Kd and Kbt are often obtained via the step-invariant and bilinear transformations, respectively. For the case when K is stable, it is show...
Guofeng Zhang, Tongwen Chen