Sciweavers

42 search results - page 4 / 9
» Linear And Hereditary Discrepancy
Sort
View
WG
2004
Springer
14 years 2 months ago
Treelike Comparability Graphs: Characterization, Recognition, and Applications
An undirected graph is a treelike comparability graph if it admits a transitive orientation such that its transitive reduction is a tree. We show that treelike comparability graphs...
Sabine Cornelsen, Gabriele Di Stefano
ORDER
2002
74views more  ORDER 2002»
13 years 9 months ago
Lines, Trees, and Branch Spaces
: In this paper we examine the interactions between the topology of certain linearly ordered topological spaces (LOTS) and the properties of trees in whose branch spaces they embed...
Harold Bennett, David Lutzer, Mary Ellen Rudin
SIAMDM
2008
105views more  SIAMDM 2008»
13 years 8 months ago
A Simple Linear Time LexBFS Cograph Recognition Algorithm
Recently lexicographic breadth first search (LexBFS) has been shown to be a very powerful tool for the development of linear time, easily implementable recognition algorithms for v...
Anna Bretscher, Derek G. Corneil, Michel Habib, Ch...
IPCO
1992
100views Optimization» more  IPCO 1992»
13 years 10 months ago
An Exact Characterization of Greedy Structures
We present exact characterizations of structures on which the greedy algorithm produces optimal solutions. Our characterization, which we call matroid embeddings, complete the par...
Paul Helman, Bernard M. E. Moret, Henry D. Shapiro
BMVC
2010
13 years 7 months ago
Recognition from Appearance Subspaces across Image Sets of Variable Scale
Linear subspace representations of appearance variation are pervasive in computer vision. In this paper we address the problem of robustly matching them (computing the similarity ...
Ognjen Arandjelovic