Pages that link to "Item:Q1764804"
From MaRDI portal
The following pages link to A simple linear time algorithm for cograph recognition (Q1764804):
Displaying 42 items.
- Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs (Q324752) (← links)
- The most vital nodes with respect to independent set and vertex cover (Q411833) (← links)
- Edge search number of cographs (Q415273) (← links)
- A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- Acyclic and star colorings of cographs (Q643025) (← links)
- A simple linear-time recognition algorithm for weakly quasi-threshold graphs (Q659727) (← links)
- Characterizations of cographs as intersection graphs of paths on a grid (Q741533) (← links)
- An improvement on the complexity of factoring read-once Boolean functions (Q944714) (← links)
- A new characterization of \(P_{6}\)-free graphs (Q972332) (← links)
- Efficient algorithms for Roman domination on some classes of graphs (Q1003729) (← links)
- Finding a potential community in networks (Q1737592) (← links)
- Coupon coloring of cographs (Q1738081) (← links)
- On distance-preserving elimination orderings in graphs: complexity and algorithms (Q1752455) (← links)
- Eigenvalue location in cographs (Q1752501) (← links)
- Monotonicity and expansion of global secure sets (Q1761464) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- Complexity of edge monitoring on some graph classes (Q2172388) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Characterizations, probe and sandwich problems on \(( k , \ell )\)-cographs (Q2184673) (← links)
- How to compute digraph width measures on directed co-graphs (Q2220888) (← links)
- Hybrid and generalized marked systems (Q2243582) (← links)
- Reciprocal best match graphs (Q2299268) (← links)
- Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width (Q2311126) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs (Q2827819) (← links)
- BOUNDING THE NUMBER OF REDUCED TREES, COGRAPHS, AND SERIES-PARALLEL GRAPHS BY COMPRESSION (Q2846474) (← links)
- Hadwiger Number of Graphs with Small Chordality (Q2945190) (← links)
- Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures (Q3000504) (← links)
- Linear-time algorithm for the matched-domination problem in cographs (Q3101607) (← links)
- Defining and identifying cograph communities in complex networks (Q3387608) (← links)
- Probe Ptolemaic Graphs (Q3511358) (← links)
- -cospectrality and -energy in cographs (Q4640076) (← links)
- (Q4691867) (← links)
- Linear-sized independent sets in random cographs and increasing subsequences in separable permutations (Q5051470) (← links)
- Counting Perfect Matchings and the Switch Chain (Q5232145) (← links)
- Edge Search Number of Cographs in Linear Time (Q5321690) (← links)
- A Theoretical Framework for Instance Complexity of the Resource-Constrained Project Scheduling Problem (Q5870371) (← links)
- Random cographs: Brownian graphon limit and asymptotic degree distribution (Q6074680) (← links)
- (Q6089666) (← links)
- Groups, Graphs, and Hypergraphs: Average Sizes of Kernels of Generic Matrices with Support Constraints (Q6124916) (← links)
