241 search results - page 3 / 49 » Graphs, Hypergraphs and Hashing |
ACL
1998
15 years 1 months ago
1998
Word graphs are able to represent a large number of different utterance hypotheses in a very compact manner. However, usually they contain a huge amount of redundancy in terms of ...
109
Voted
JCT
2008
14 years 11 months ago
2008
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
COMBINATORICS
2006
14 years 11 months ago
2006
We generalize the Ihara-Selberg zeta function to hypergraphs in a natural way. Hashimoto's factorization results for biregular bipartite graphs apply, leading to exact factor...
GD
2009
Springer
15 years 4 months ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
COMBINATORICS
2007
14 years 11 months ago
2007
Recently, Storm [8] defined the Ihara-Selberg zeta function of a hypergraph, and gave two determinant expressions of it. We define the Bartholdi zeta function of a hypergraph, a...