813 search results - page 4 / 163 » On the Boolean-Width of a Graph: Structure and Applications |
WSDM
2009
ACM
14 years 1 months ago
2009
ACM
This paper focuses on ‘user browsing graph’ which is constructed with users’ click-through behavior modeled with Web access logs. User browsing graph has recently been adopt...
STOC
1990
ACM
13 years 11 months ago
1990
ACM
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
ICDAR
2011
IEEE
12 years 6 months ago
2011
IEEE
—We present a method for spotting a subgraph in a graph repository. Subgraph spotting is a very interesting research problem for various application domains where the use of a re...
AMC
2008
13 years 7 months ago
2008
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
MVA
1996
13 years 8 months ago
1996
The issue of graph recognition has been not always investigated until today though the subjects on the document image understanding are very interest and have proposed many method...