Decision problem for minimum interconnection trees in multipartite graphs is NP-complete but FPT in number of parts and polynomial-time on complete, quasi-complete, and t-quasi-complete graphs.
\ Enumeration Complexity: Incremental Time, Delay and Space
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A Bayesian network models the missingness mechanism in databases to enable probabilistic query answering on a derived block-independent probabilistic database, with complexity results.
citing papers explorer
-
Complexity of Finding and Enumerating Interconnection Trees
Decision problem for minimum interconnection trees in multipartite graphs is NP-complete but FPT in number of parts and polynomial-time on complete, quasi-complete, and t-quasi-complete graphs.
-
Database Querying under Missing Values Governed by Missingness Mechanisms
A Bayesian network models the missingness mechanism in databases to enable probabilistic query answering on a derived block-independent probabilistic database, with complexity results.