MathematicsComputer Science
B. Courcelle, J. Makowsky, U. Rotics
2000.3.4THEORY OF COMPUTING SYSTEMS
tlooto सारांश
It is proved that this is also the case for graphs of clique-width at most k, where this complexity measure is associated with hierarchical decompositions of another type, and where logical formulas are no longer allowed to use edge set quantifications.
सारांश
सार उपलब्ध नहीं है।
साइटेशन फॉर्मेट
COURCELLE, B.; MAKOWSKY, J.; ROTICS, U. Linear time solvable optimization problems on graphs of bounded clique-width. THEORY OF COMPUTING SYSTEMS, 2000, 33: 125–150.