MAS/MaxST admits an FPT algorithm for integer weights and an XP algorithm for rational weights ≥1, both finding acyclic subgraphs of weight at least MaxST(G)+k.
American Journal of Mathematics , year =
3 Pith papers cite this work, alongside 943 external citations. Polarity classification is still indexing.
3
Pith papers citing it
943
external citations · OpenAlex
years
2026 3representative citing papers
Two constrained recognition problems for oriented interval graphs are solved in linear time, improving a prior quadratic algorithm and solving the proper/unit case.
OEH is a unified index that supports subsumption order-testing and index-resident monoid roll-up on poset hierarchies via nested-set embeddings for trees or chain decomposition for low-width DAGs.
citing papers explorer
-
Exploiting Spanning Trees for Directed Acyclicity
MAS/MaxST admits an FPT algorithm for integer weights and an XP algorithm for rational weights ≥1, both finding acyclic subgraphs of weight at least MaxST(G)+k.
-
Towards the Recognition of Oriented Interval Graphs
Two constrained recognition problems for oriented interval graphs are solved in linear time, improving a prior quadratic algorithm and solving the proper/unit case.
-
One Index for Subsumption and Roll-up across Time, Geography, and Ontology
OEH is a unified index that supports subsumption order-testing and index-resident monoid roll-up on poset hierarchies via nested-set embeddings for trees or chain decomposition for low-width DAGs.