Pages that link to "Item:Q3665151"
From MaRDI portal
The following pages link to A Fast Algorithm for the Decomposition of Graphs and Posets (Q3665151):
Displaying 39 items.
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- Characterization and complexity of uniformly nonprimitive labeled 2-structures (Q672749) (← links)
- Almost all comparability graphs are UPO (Q795847) (← links)
- On transitive orientations with restricted covering graphs (Q845912) (← links)
- On the complexity of dynamic programming for sequencing problems with precedence constraints (Q922284) (← links)
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited (Q967361) (← links)
- Critically indecomposable graphs (Q1003768) (← links)
- A decomposition of distributive lattices (Q1057293) (← links)
- An algorithm for minimizing setups in precedence constrained scheduling (Q1069848) (← links)
- A combinatorial bijection between linear extensions of equivalent orders (Q1078213) (← links)
- On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
- On finding the jump number of a partial order by substitution decomposition (Q1092072) (← links)
- Minimizing bumps in ordered sets by substitution decomposition (Q1122595) (← links)
- The discrete time-cost tradeoff problem revisited (Q1129886) (← links)
- \(P_ 4\)-trees and substitution decomposition (Q1201812) (← links)
- Optimal procedures for the discrete time/cost trade-off problem in project networks (Q1266562) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- Incremental construction of 2-structures (Q1322177) (← links)
- Complexity of list coloring problems with a fixed total number of colors (Q1348378) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- Scattering number and modular decomposition (Q1356754) (← links)
- Indecomposable graphs (Q1367028) (← links)
- Weighted parameters in \((P_5,\overline {P_5})\)-free graphs (Q1382285) (← links)
- On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs (Q1390873) (← links)
- Single machine scheduling with precedence constraints and positionally dependent processing times (Q1762097) (← links)
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures (Q1897475) (← links)
- A continuous rating method for preferential voting: the complete case (Q1926601) (← links)
- Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
- Applying modular decomposition to parameterized cluster editing problems (Q2272201) (← links)
- Clique-perfectness and balancedness of some graph classes (Q2931952) (← links)
- The dimension of graphs with respect to the direct powers of a two-element graph (Q3751619) (← links)
- Decomposition of Directed Graphs (Q3960725) (← links)
- Nonpreemptive scheduling of independent tasks with prespecified processor allocations (Q4319223) (← links)
- Dynamic labeled 2-structures (Q4327408) (← links)
- Theory of 2-structures (Q4645162) (← links)
- Group based graph transformations and hierarchical representations of graphs (Q4645297) (← links)
- ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S (Q5249008) (← links)
- (Q5708507) (← links)
- Irreducible pairings and indecomposable tournaments (Q6580491) (← links)
