677 search results - page 62 / 136 » Bipartite roots of graphs |
77
Voted
EJC
2007
15 years 1 months ago
2007
We investigate the historical roots of the field of combinatorics on words. They comprise applications and interpretations in algebra, geometry and combinatorial enumeration. The...
118
Voted
WG
1993
Springer
15 years 5 months ago
1993
Springer
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...
93
Voted
SIGIR
2006
ACM
15 years 7 months ago
2006
ACM
We present an approach to improving the precision of an initial document ranking wherein we utilize cluster information within a graph-based framework. The main idea is to perform...
103
Voted
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
114
Voted
IPL
2010
14 years 11 months ago
2010
We present an O(n) Breadth-First Search algorithm for trapezoid graphs, which takes as input a trapezoid model and any priority order on the vertices. Our algorithm is the first ...