Search for Author All Reviews
	Golovach, Petr A.     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 1 of 1 reviews       Parameterized complexity of connected even/odd subgraph problems Fomin F., Golovach P. Journal of Computer and System Sciences 80(1): 157-179, 2014.  Type: Article The notion of fixed parameter tractability involves relaxed polynomial-time complexity, which admits algorithms whose runtimes are exponential, but only in terms of some parameter that is expected to be small. More formally, a problem ...... Jan 2 2014
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy