9 results on '"Eva-Marta Lundell"'
Search Results
2. Detecting and Counting Small Pattern Graphs.
3. Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?
4. Unique Small Subgraphs Are Not Easier to Find.
5. Counting and detecting small subgraphs via equations and matrix multiplication.
6. Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs.
7. On the Approximability of Maximum and Minimum Edge Clique Partition Problems.
8. Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices.
9. Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.