Maximum Motif Problem in Vertex-Colored Graphs (Q3637115): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms and Hardness Results for Some Graph Motif Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4507228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of comparing evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximation of Shortest Common Supersequences and Longest Common Subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research in Computational Molecular Biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research in Computational Molecular Biology / rank
 
Normal rank

Latest revision as of 18:56, 1 July 2024

scientific article
Language Label Description Also known as
English
Maximum Motif Problem in Vertex-Colored Graphs
scientific article

    Statements