Pages that link to "Item:Q4187325"
From MaRDI portal
The following pages link to A Linear Time Algorithm for Deciding Interval Graph Isomorphism (Q4187325):
Displayed 50 items.
- On the isomorphism problem for Helly circular-arc graphs (Q259081) (← links)
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs (Q344864) (← links)
- Solving the canonical representation and star system problems for proper circular-arc graphs in logspace (Q350727) (← links)
- Random generation and enumeration of bipartite permutation graphs (Q414425) (← links)
- Computing role assignments of proper interval graphs in polynomial time (Q450561) (← links)
- Subgraph isomorphism in graph classes (Q456655) (← links)
- The list distinguishing number equals the distinguishing number for interval graphs (Q503677) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Reconstruction of interval graphs (Q604467) (← links)
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs (Q896655) (← links)
- On the isomorphism of graphs having some eigenvalues of moderate multiplicity (Q896861) (← links)
- Isomorphism testing of k-trees is in NC, for fixed k (Q910212) (← links)
- An optimal greedy heuristic to color interval graphs (Q922724) (← links)
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results (Q1044994) (← links)
- Graph isomorphism problem (Q1057883) (← links)
- Polynomial isomorphism algorithm for graphs which do not pinch to \(K_{3,g}\) (Q1077933) (← links)
- An efficient parallel algorithm for planarity (Q1114415) (← links)
- Strong tree-cographs are Birkhoff graphs (Q1119942) (← links)
- Complement reducible graphs (Q1153105) (← links)
- A note on compact graphs (Q1174181) (← links)
- The isomorphism problem for classes of graphs closed under contraction (Q1175965) (← links)
- On a unique tree representation for \(P_ 4\)-extendible graphs (Q1182318) (← links)
- A tree representation for \(P_ 4\)-sparse graphs (Q1183332) (← links)
- A linear-time algorithm for isomorphism of a subclass of chordal graphs (Q1195864) (← links)
- Efficient parallel recognition of some circular arc graphs. I (Q1209733) (← links)
- Simulated annealing and the mapping problem: A computational study (Q1318465) (← links)
- A fast parallel algorithm to recognize P4-sparse graphs (Q1382265) (← links)
- On the structure of graphs with few \(P_4\)s (Q1392556) (← links)
- On linear and circular structure of (claw, net)-free graphs (Q1406025) (← links)
- A selected tour of the theory of identification matrices (Q1575436) (← links)
- The QAP-polytope and the graph isomorphism problem (Q1631655) (← links)
- Polynomial time algorithms for variants of graph matching on partial \(k\)-trees (Q1692069) (← links)
- Induced minor free graphs: isomorphism and clique-width (Q1702118) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- VF2++ -- an improved subgraph isomorphism algorithm (Q1744243) (← links)
- Canonical representations for circular-arc graphs using flip sets (Q1799215) (← links)
- Graph recurrence (Q1869026) (← links)
- Isomorphism of chordal (6, 3) graphs (Q1893148) (← links)
- Intersection graphs of Helly families of subtrees (Q1917300) (← links)
- Cleaning interval graphs (Q1939654) (← links)
- Integral mixed unit interval graphs (Q1949108) (← links)
- Graph isomorphism and identification matrices: Sequential algorithms (Q1970201) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Recognizing simple-triangle graphs by restricted 2-chain subgraph cover (Q2181225) (← links)
- Optimal greedy algorithms for indifference graphs (Q2365550) (← links)
- Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model (Q2418739) (← links)
- Computing Role Assignments of Proper Interval Graphs in Polynomial Time (Q3000505) (← links)
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs (Q3512472) (← links)
- Random Generation and Enumeration of Proper Interval Graphs (Q3605496) (← links)
- Intersection graphs of proper subtrees of unicyclic graphs (Q4309989) (← links)