58:
43:
66:
49:
32:
90:
17:
76:
incorrectly led you here, you may wish to change the link to point directly to the intended article.
46:, a graph that is an induced subgraph of two given graphs and has as many vertices as possible
84:
28:
52:, a graph that is a subgraph of two given graphs and has as many edges as possible
69:
includes a list of related items that share the same name (or similar names).
57:
73:
63:Index of articles associated with the same name
8:
18:Maximum common subgraph isomorphism problem
7:
25:
56:
44:Maximum common induced subgraph
1:
50:Maximum common edge subgraph
33:theoretical computer science
107:
55:
37:maximum common subgraph
91:Set index articles
67:set index article
39:may mean either:
16:(Redirected from
98:
77:
60:
21:
106:
105:
101:
100:
99:
97:
96:
95:
81:
80:
79:
78:
71:
70:
64:
23:
22:
15:
12:
11:
5:
104:
102:
94:
93:
83:
82:
62:
61:
54:
53:
47:
24:
14:
13:
10:
9:
6:
4:
3:
2:
103:
92:
89:
88:
86:
75:
74:internal link
68:
59:
51:
48:
45:
42:
41:
40:
38:
34:
30:
19:
36:
29:graph theory
26:
85:Category
72:If an
65:This
35:, a
31:and
27:In
87::
20:)
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
