A Linear Time Algorithm for Deciding Interval Graph Isomorphism
From MaRDI portal
Publication:4187325
Cited in
(69)- Integral mixed unit interval graphs
- Canonical representations for circular-arc graphs using flip sets
- A fast parallel algorithm to recognize P4-sparse graphs
- Random generation and enumeration of bipartite permutation graphs
- On the isomorphism problem for Helly circular-arc graphs
- An efficient parallel algorithm for planarity
- Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable (extended abstract)
- Reconstruction of Interval Graphs
- On-line recognition of interval graphs in \(O(m+n \log n)\) time
- The Neighborhood Polynomial of Chordal Graphs
- Simple Geometrical Intersection Graphs
- The QAP-polytope and the graph isomorphism problem
- Computing role assignments of proper interval graphs in polynomial time
- Parameterized complexity of multicut in weighted trees
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs
- On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
- Simulated annealing and the mapping problem: A computational study
- Polynomial time algorithms for variants of graph matching on partial k-trees
- Subgraph isomorphism in graph classes
- Complement reducible graphs
- On \(H\)-topological intersection graphs
- A note on compact graphs
- Graph isomorphism and identification matrices: Sequential algorithms
- Computing role assignments of proper interval graphs in polynomial time
- Graphs with at most two moplexes
- Isomorphism of chordal (6, 3) graphs
- Graph theory (algorithmic, algebraic, and metric problems)
- Polynomial-time algorithms for subgraph isomorphism in small graph classes of perfect graphs
- Tractabilities and intractabilities on geometric intersection graphs
- Random Generation and Enumeration of Proper Interval Graphs
- On linear and circular structure of (claw, net)-free graphs
- Reconstruction of interval graphs
- Strong tree-cographs are Birkhoff graphs
- A tree representation for \(P_ 4\)-sparse graphs
- On a unique tree representation for \(P_ 4\)-extendible graphs
- Optimal greedy algorithms for indifference graphs
- Recognizing generalized Sierpiński graphs
- Neighborhood hypergraphs of bipartite graphs
- The isomorphism problem for classes of graphs closed under contraction
- On the isomorphism of graphs having some eigenvalues of moderate multiplicity
- Directed path graph isomorphism
- Graph isomorphism restricted by lists
- Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
- An optimal greedy heuristic to color interval graphs
- Intersection graphs of Helly families of subtrees
- Isomorphism testing of k-trees is in NC, for fixed k
- Solving the canonical representation and star system problems for proper circular-arc graphs in logspace
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage
- Coloring mixed and directional interval graphs
- On the structure of graphs with few P₄s
- On the L(h, k)‐labeling of co‐comparability graphs and circular‐arc graphs
- Enumeration of nonisomorphic interval graphs and nonisomorphic permutation graphs
- Intersection graphs of proper subtrees of unicyclic graphs
- A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs
- A linear-time algorithm for isomorphism of a subclass of chordal graphs
- The list distinguishing number equals the distinguishing number for interval graphs
- Cleaning interval graphs
- Linear-time generation of random chordal graphs
- Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model
- Efficient parallel recognition of some circular arc graphs. I
- Polynomial isomorphism algorithm for graphs which do not pinch to \(K_{3,g}\)
- Graph isomorphism problem
- Mobility offer allocations in corporate settings
- Graph recurrence
- A selected tour of the theory of identification matrices
- VF2++ -- an improved subgraph isomorphism algorithm
- Computing a dominating pair in an asteroidal triple-free graph in linear time
- On the isomorphism of graphs with few P4s
- Revising Johnson's table for the 21st century
This page was built for publication: A Linear Time Algorithm for Deciding Interval Graph Isomorphism
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187325)