Filtering for Subgraph Isomorphism (Q3523085): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-74970-7_51 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1735683409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Subgraph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction algorithms for graph pattern matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Filtering for Subgraph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: CP(Graph): Introducing a Graph Computation Domain in Constraint Programming / rank
 
Normal rank

Latest revision as of 15:51, 28 June 2024