The following pages link to Algorithm Theory - SWAT 2004 (Q5315370):
Displaying 19 items.
- Autonomous sets for the hypergraph of all canonical covers (Q429444) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- A distance measure for large graphs based on prime graphs (Q531270) (← links)
- Transitive orientations in bull-reducible Berge graphs (Q531595) (← links)
- Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
- Almost every graph is divergent under the biclique operator (Q908300) (← links)
- Partitioned probe comparability graphs (Q924151) (← links)
- On probe permutation graphs (Q967305) (← links)
- Algorithmic aspects of a general modular decomposition theory (Q1026102) (← links)
- An efficient exact algorithm for triangle listing in large graphs (Q1741284) (← links)
- Vertex removal in biclique graphs (Q2091812) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Applying modular decomposition to parameterized cluster editing problems (Q2272201) (← links)
- Some results on more flexible versions of Graph Motif (Q2354588) (← links)
- Parameterized algorithms for edge biclique and related problems (Q2636505) (← links)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
- A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs (Q2672614) (← links)
- An Analytic Propositional Proof System on Graphs (Q5060181) (← links)
- Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
