Finding minimally weighted subgraphs

Authors:
Jürgen Plehn;Bernd Voigt
Affiliations:
-;-
Venue:
WG '90 Proceedings of the 16th international workshop on Graph-theoretic concepts in computer science
Year:
1991

Citing 0
Cited 6

Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Color-coding

Journal of the ACM (JACM)
Subgraph isomorphism in planar graphs and related problems

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
The complexity of homomorphism and constraint satisfaction problems seen from the other side

Journal of the ACM (JACM)
A parameterized view on matroid optimization problems

Theoretical Computer Science
A parameterized view on matroid optimization problems

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract