Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
Cograph
OpenAlex ID:
C59824394
Algebraic Graph Theory
2001
·
Chris Godsil
, Gordon Royle
·
Graduate texts in mathematics
·
8,902
A (sub)graph isomorphism algorithm for matching large graphs
2004
·
L.P. Cordella
, P. Foggia
, et al.
·
IEEE Transactions on Pattern Analysis and Machine Intelligence
·
1,794
A graduated assignment algorithm for graph matching
1996
·
S. Gold
, A. Rangarajan
·
IEEE Transactions on Pattern Analysis and Machine Intelligence
·
1,187
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width
2000
·
B. Courcelle
, J. A. Makowsky
, et al.
·
Theory of Computing Systems
·
963
Optimal packing and covering in the plane are NP-complete
1981
·
Robert J. Fowler
, Michael S. Paterson
, et al.
·
Information Processing Letters
·
836
Regular Partitions of Graphs
1975
·
Endre Szemerédi
·
826
A Linear Recognition Algorithm for Cographs
1985
·
D. G. Corneil
, Y. Perl
, et al.
·
SIAM Journal on Computing
·
712
On a relation between graph edit distance and maximum common subgraph
1997
·
H. Bunke
·
Pattern Recognition Letters
·
635
Non-Separable and Planar Graphs
1932
·
Hassler Whitney
·
Transactions of the American Mathematical Society
·
622
PDF
Graphs-at-a-time: query language and access methods for graph databases
2008
·
Huahai He
, Ambuj K. Singh
·
ACM SIGMOD International Conference on Management of Data (SIGMOD)
·
568
Quasi-random graphs
1989
·
F. R. K. Chung
, R. L. Graham
, et al.
·
COMBINATORICA
·
557
Modular decomposition and transitive orientation
1999
·
Ross M. McConnell
, Jeremy P. Spinrad
·
Discrete Mathematics
·
485
PDF
Decomposition by clique separators
1985
·
Robert E. Tarjan
·
Discrete Mathematics
·
472
Polynomial Algorithms for Perfect Graphs
1984
·
M. Grötschel
, L. Lovász
, et al.
·
North-Holland mathematics studies
·
464
PDF
A characterization of perfect graphs
1972
·
L Lovász
·
Journal of Combinatorial Theory Series B
·
403
PDF
A new algorithm for error-tolerant subgraph isomorphism detection
1998
·
B.T. Messmer
, H. Bunke
·
IEEE Transactions on Pattern Analysis and Machine Intelligence
·
390
Random graphs with a given degree sequence
2011
·
Sourav Chatterjee
, Persi Diaconis
, et al.
·
The Annals of Applied Probability
·
346
PDF
k -Degenerate Graphs
1970
·
Don R. Lick
, Arthur T. White
·
Canadian Journal of Mathematics
·
332
PDF
Efficient algorithms for interval graphs and circular‐arc graphs
1982
·
U. I. Gupta
, D. T. Lee
, et al.
·
Networks
·
306
Subgraph Matching Kernels for Attributed Graphs
2012
·
Kriege, Nils
, Mutzel, Petra
·
arXiv (Cornell University)
·
296
PDF
Rank-width and vertex-minors
2005
·
Sang-il Oum
·
Journal of Combinatorial Theory Series B
·
284
PDF
The Complexity of Counting in Sparse, Regular, and Planar Graphs
2001
·
Salil P. Vadhan
·
SIAM Journal on Computing
·
275
Clustering and domination in perfect graphs
1984
·
D.G. Corneil
, Y. Perl
·
Discrete Applied Mathematics
·
275
The splittance of a graph
1981
·
Peter L. Hammer
, Bruno Simeone
·
COMBINATORICA
·
262
Error correcting graph matching: on the influence of the underlying cost function
1999
·
H. Bunke
·
IEEE Transactions on Pattern Analysis and Machine Intelligence
·
255
Show more works
View as search
Works count:
5,473
Citation count:
78,370
Year
Topic
Type