Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-14T12:50:03.516132Z
Paper Citation Record · LEDGER
The Maximum Common Subgraph Problem: A Portfolio Approach
As of 16 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:1908.06418.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
30 of 30 outbound references displayed
- verified exact3
- verified fuzzy24
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch3
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation b93c86d1-76fa-4266-8b34-5640a32e4302 · outbound
This paper cites Subgraph isomorphism, matching relational structures and maximal cliques,.
The Maximum Common Subgraph Problem: A Portfolio Approach Subgraph isomorphism, matching relational structures and maximal cliques,
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:04.260660Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 1e875d12-7ed8-4e29-befa-535a9293bfd1 · outbound
This paper cites Finding all cliques of an undirected graph (algorithm 457),.
The Maximum Common Subgraph Problem: A Portfolio Approach Finding all cliques of an undirected graph (algorithm 457),
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:04.245430Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 9a56e984-3e1d-4dde-96ca-79c12b25a985 · outbound
This paper cites A partitioning algorithm for maximum common subgraph problems,.
The Maximum Common Subgraph Problem: A Portfolio Approach A partitioning algorithm for maximum common subgraph problems,
Reference 3
- Resolution
- metadata mismatch
- raw_fallback, observed 2026-08-14T12:50:03.862347Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation bea18798-0f5a-48fc-986f-00abcf1a3d49 · outbound
This paper cites The SAT Competition Web Page,.
The Maximum Common Subgraph Problem: A Portfolio Approach The SAT Competition Web Page,
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:04.227590Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 1da4eae4-be2a-46d4-9eea-5c3430f01bad · outbound
This paper cites The SMT Competition Web Page,.
The Maximum Common Subgraph Problem: A Portfolio Approach The SMT Competition Web Page,
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:04.209278Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation df21e1f5-3209-4e3d-a6f5-4042b8b3b185 · outbound
This paper cites Portfolios of subgraph iso- morphism algorithms,.
The Maximum Common Subgraph Problem: A Portfolio Approach Portfolios of subgraph iso- morphism algorithms,
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:04.186904Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 9daa59a1-8a1d-41fb-ae24-90b6c4233779 · outbound
This paper cites A large database of graphs and its use for benchmarking graph isomorphism algorithms,.
The Maximum Common Subgraph Problem: A Portfolio Approach A large database of graphs and its use for benchmarking graph isomorphism algorithms,
Reference 7
- Resolution
- verified exact
- doi, observed 2026-08-14T12:50:03.591171Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation d1ce6098-3412-40b0-9650-a31ffeda3608 · outbound
This paper cites A database of graphs for iso- morphism and sub-graph isomorphism benchmarking,.
The Maximum Common Subgraph Problem: A Portfolio Approach A database of graphs for iso- morphism and sub-graph isomorphism benchmarking,
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:04.171083Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 13b86d0f-9823-4031-a9ac-81a74b74adbf · outbound
This paper cites A comparison of algorithms for maximum common subgraph on randomly connected graphs,.
The Maximum Common Subgraph Problem: A Portfolio Approach A comparison of algorithms for maximum common subgraph on randomly connected graphs,
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:04.155386Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 3077f088-7369-4646-8019-93b069f5e9ea · outbound
This paper cites Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs.
The Maximum Common Subgraph Problem: A Portfolio Approach Challenging complexity of maximum common subgraph detection algorithms: A performance analysis of three algorithms on a wide database of graphs
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:04.141017Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 067d69fd-9ac0-4bae-bdda-20decafd2beb · outbound
This paper cites Finding maximum common connected sub- graphs using clique detection or constraint satisfaction algorithms,.
The Maximum Common Subgraph Problem: A Portfolio Approach Finding maximum common connected sub- graphs using clique detection or constraint satisfaction algorithms,
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:04.125760Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation c3287914-ae62-4485-9cc8-552af3439f1f · outbound
This paper cites Searching for a maximum common induced subgraph by decomposing the compatibility graph,.
The Maximum Common Subgraph Problem: A Portfolio Approach Searching for a maximum common induced subgraph by decomposing the compatibility graph,
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:04.110308Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 7d8393e4-1c2e-4446-b477-54fab0718e88 · outbound
This paper cites Approximating the maximum common subgraph isomorphism problem with a weighted graph,.
The Maximum Common Subgraph Problem: A Portfolio Approach Approximating the maximum common subgraph isomorphism problem with a weighted graph,
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:04.094928Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation d8a0bc83-af5d-428a-ab42-3d0ece66c7f3 · outbound
This paper cites Graph clustering using the weighted minimum common supergraph,.
The Maximum Common Subgraph Problem: A Portfolio Approach Graph clustering using the weighted minimum common supergraph,
Reference 14
- Resolution
- metadata mismatch
- raw_fallback, observed 2026-08-14T12:50:03.784525Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 70fff84d-0a03-430e-aff8-8b0531d5129f · outbound
This paper cites A measure of similarity between graph vertices: Applications to synonym extraction and web searching,.
The Maximum Common Subgraph Problem: A Portfolio Approach A measure of similarity between graph vertices: Applications to synonym extraction and web searching,
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:04.078724Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 04b46d85-5efb-440d-a34b-29906bc85584 · outbound
This paper cites Graph similarity and matching,.
The Maximum Common Subgraph Problem: A Portfolio Approach Graph similarity and matching,
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:04.061625Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation c289da0b-4ca5-4b74-b759-97f6a2e7ac0c · outbound
This paper cites Mcsplit implementations,.
The Maximum Common Subgraph Problem: A Portfolio Approach Mcsplit implementations,
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:04.044859Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation ff842078-ef1d-4fb0-b1a3-9113dd659a68 · outbound
This paper cites Solving hard subgraph problems in parallel,.
The Maximum Common Subgraph Problem: A Portfolio Approach Solving hard subgraph problems in parallel,
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:04.023530Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 12ad6dbd-6924-4c4c-83c6-95397a3f3632 · outbound
This paper cites Observations from parallelising three maximum common (connected) subgraph algorithms,.
The Maximum Common Subgraph Problem: A Portfolio Approach Observations from parallelising three maximum common (connected) subgraph algorithms,
Reference 19
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:04.005780Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation c0c2f812-83bd-427b-8b14-3175f95960bc · outbound
This paper cites Hardware Model Checking Competition 2014: An Analysis and Comparison of Model Checkers and Benchmarks,.
The Maximum Common Subgraph Problem: A Portfolio Approach Hardware Model Checking Competition 2014: An Analysis and Comparison of Model Checkers and Benchmarks,
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:03.989680Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation d0dfab56-7d84-43b3-83e1-0b62919bda3b · outbound
This paper cites Experiments with mas- sively parallel constraint solving,.
The Maximum Common Subgraph Problem: A Portfolio Approach Experiments with mas- sively parallel constraint solving,
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:03.973578Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 30839f89-d832-4e0d-83a2-ca156f297432 · outbound
This paper cites SATzilla: Portfolio- based Algorithm Selection for SAT,.
The Maximum Common Subgraph Problem: A Portfolio Approach SATzilla: Portfolio- based Algorithm Selection for SAT,
Reference 22
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:03.955179Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation d700580c-e543-4cb1-92da-3866ea51b9c1 · outbound
This paper cites A self-adaptive multi-engine solver for quantified boolean formulas,.
The Maximum Common Subgraph Problem: A Portfolio Approach A self-adaptive multi-engine solver for quantified boolean formulas,
Reference 23
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:03.940103Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation ea275d50-0767-43f2-9d6e-55da683fc6a5 · outbound
This paper cites Manysat: a parallel sat solver,.
The Maximum Common Subgraph Problem: A Portfolio Approach Manysat: a parallel sat solver,
Reference 24
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:03.923764Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation ab34afea-84ae-43f9-a2cc-dc33e0302c0f · outbound
This paper cites Clique and constraint models for maximum common (connected) subgraph prob- lems,.
The Maximum Common Subgraph Problem: A Portfolio Approach Clique and constraint models for maximum common (connected) subgraph prob- lems,
Reference 25
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:03.908357Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation b1c84b82-dfd1-4d37-9a1f-0bf73ec34d89 · outbound
This paper cites Between subgraph isomor- phism and maximum common subgraph,.
The Maximum Common Subgraph Problem: A Portfolio Approach Between subgraph isomor- phism and maximum common subgraph,
Reference 26
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:03.893583Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 272de602-99e5-4004-968e-77f2313acbbb · outbound
This paper cites The partitioned preassigned pivot proce- dure (p4),.
The Maximum Common Subgraph Problem: A Portfolio Approach The partitioned preassigned pivot proce- dure (p4),
Reference 27
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-14T12:50:03.877979Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 34aec93a-00e7-4ea1-85e1-be0053b59743 · outbound
This paper cites Boosting combinatorial search through randomization,.
The Maximum Common Subgraph Problem: A Portfolio Approach Boosting combinatorial search through randomization,
Reference 28
- Resolution
- metadata mismatch
- raw_fallback, observed 2026-08-14T12:50:03.711905Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 62b323db-8b34-497a-94b9-774e3cde6a71 · outbound
This paper cites Available: https://doi.org/10.1137/S0036144502415960.
The Maximum Common Subgraph Problem: A Portfolio Approach Available: https://doi.org/10.1137/S0036144502415960
Reference 2004
- Resolution
- verified exact
- doi, observed 2026-08-14T12:50:03.573909Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Observation 240290f2-e97e-47a1-96c8-aac5bcc69bca · outbound
This paper cites Available: https://doi.org/10.1007/s10601-008-9051-2.
The Maximum Common Subgraph Problem: A Portfolio Approach Available: https://doi.org/10.1007/s10601-008-9051-2
Reference 2009
- Resolution
- verified exact
- doi, observed 2026-08-14T12:50:03.558008Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.
Pith citing papers
No inbound Pith citation observations are available.