Computing role assignments of proper interval graphs in polynomial time
DOI10.1007/978-3-642-19222-7_18zbMATH Open1326.68159OpenAlexW2178299939MaRDI QIDQ3000505FDOQ3000505
Authors: Pinar Heggernes, Pim Van 't Hof, Daniël Paulusma 
Publication date: 19 May 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://dro.dur.ac.uk/18308/1/18308.pdf
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Graph Classes: A Survey
- Algorithmic graph theory and perfect graphs
- Incidence matrices and interval graphs
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- A Linear Time Algorithm for Deciding Interval Graph Isomorphism
- Title not available (Why is that?)
- Representation of a finite graph by a set of intervals on the real line
- Role colouring a graph
- 2-role assignments on triangulated graphs.
- Local computations in graphs: the case of cellular edge local computations
- The role assignment model nearly fits most social networks
- A complete complexity classification of the role assignment problem
- Comparing universal covers in polynomial time
- The clique-separator graph for chordal graphs
- Fixed-parameter complexity of \(\lambda\)-labelings
- Covering regular graphs
- Partial covers of graphs
- Title not available (Why is that?)
- Graph Labelings Derived from Models in Distributed Computing
- Finite planar emulators for \(K_{4,5} - 4K_{2}\) and \(K_{1,2,2,2}\) and Fellows' conjecture
Cited In (5)
This page was built for publication: Computing role assignments of proper interval graphs in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000505)
