In combinatorics, an area of mathematics, graph enumeration describes a class of combinatorial enumeration problems in which one must count… (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2016

2016

- Longbin Lai, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang
- PVLDB
- 2016

Subgraph enumeration aims to find all the subgraphs of a large data graph that are isomorphic to a given pattern graph. As the… (More)

Is this relevant?

2014

2014

- Erkan Gunpinar, Masaki Moriguchi, Hiromasa Suzuki, Yutaka Ohtake
- Computer-Aided Design
- 2014

Recently proposed quad-meshing techniques allow the generation of high-quality semi-regular quadrilateral meshes. This paper… (More)

Is this relevant?

2013

2013

- George M. Slota, Kamesh Madduri
- 2013 42nd International Conference on Parallel…
- 2013

We present a new shared-memory parallel algorithm and implementation called FASCIA for the problems of approximate sub graph… (More)

Is this relevant?

2011

2011

- Tobias Nipkow
- ITP
- 2011

Due to a recent revision of Hales’s proof of the Kepler Conjecture, the existing verification of the central graph enumeration… (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- Shijie Zhang, Jiong Yang, Wei Jin
- PVLDB
- 2010

With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc… (More)

Is this relevant?

2008

2008

Let Γ be a quiver on n vertices v1, v2, . . . , vn with gij edges between vi and vj , and let α ∈ Nn. Hua gave a formula for A… (More)

Is this relevant?

2005

2005

- Boris Pittel, Nicholas C. Wormald
- J. Comb. Theory, Ser. B
- 2005

The theme of this work is an “inside-out” approach to the enumeration of graphs. It is based on a well-known decomposition of a… (More)

Is this relevant?

2004

2004

- Hin Hark Gan, Daniela Fera, +5 authors Tamar Schlick
- Bioinformatics
- 2004

Motivation: Understanding RNA’s structural diversity is vital for identifying novel RNA structures and pursuing RNA genomics… (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Bruno Courcelle, Johann A. Makowsky, Udi Rotics
- Discrete Applied Mathematics
- 2001

We discuss the parametrized complexity of counting and evaluation problems on graphs where the range of counting is deenable in… (More)

Is this relevant?

Highly Cited

1973