scientific article; zbMATH DE number 3859178
From MaRDI portal
Publication:3328583
Recommendations
Cited in
(only showing first 100 items - show all)- Trapezoid graphs and their coloring
- Characterizing –partitionable Cographs
- A faster parallel connectivity algorithm on cographs
- Domination and total domination on asteroidal triple-free graphs
- Pattern matching for permutations
- A charming class of perfectly orderable graphs
- Constant-time parallel recognition of split graphs
- Finding minimum height elimination trees for interval graphs in polynomial time
- Finding biconnected components in O(n) time for a class of graphs
- The hardness of approximating the boxicity, cubicity and threshold dimension of a graph
- The forbidden subgraph characterization of directed vertex graphs
- Partitioning chordal graphs into independent sets and cliques
- \(P_ 4\)-trees and substitution decomposition
- Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs
- On the longest upsequence problem for permutations
- On a graph partition problem with application to VLSI layout
- A linear time algorithm to construct a tree 4-spanner on trapezoid graphs
- Container ship stowage problem complexity and connection to the coloring of circle graphs
- Linear time algorithms for dominating pairs in asteroidal triple-free graphs
- Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs
- Minimal triangulations of graphs: a survey
- On the SPANNING \(k\)-TREE problem
- A linear-time algorithm for the weighted feedback vertex problem on interval graphs
- An approximation result for a duo-processor task scheduling problem
- A parallel algorithm for solving the coloring problem on trapezoid graphs
- A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
- Coloring perfect \((K_ 4\)-e)-free graphs
- A simple optimal parallel algorithm for the minimum coloring problem on interval graphs
- Efficient algorithms for finding depth-first and breadth-first search trees in permutation graphs
- Parallel algorithms for permutation graphs
- Preference structures and threshold models
- Stability number of bull- and chair-free graphs
- Efficient enumeration of all minimal separators in a graph
- A note on the complexity of locating-total domination in graphs
- Listing all potential maximal cliques of a graph
- Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
- The permutation-path coloring problem on trees.
- Pathwidth of Circular-Arc Graphs
- Totally-Balanced and Greedy Matrices
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- Dominating sets in perfect graphs
- Graph spanners
- On the feedback vertex set problem in permutation graphs
- How hard is it to determine if a graph has a 2-role assignment?
- On a unique tree representation for \(P_ 4\)-extendible graphs
- Transitive closure for restricted classes of partial orders
- Multidimensional scaling and threshold graphs
- Online scheduling with interval conflicts
- A parallel algorithm for minimum weighted colouring of triangulated graphs
- Recognizing bull-free perfect graphs
- Comparability graph augmentation for some multiprocessor scheduling problems
- Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem
- Maximal chordal subgraphs
- Transitive oriented 3 hypergraphs of cyclic orders
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- Boxicity and treewidth
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
- Generalized vertex covering in interval graphs
- Towards the reconstruction of posets
- Quasi-planar graphs have a linear number of edges
- Embedding planar graphs in four pages
- Maximum \(k\)-covering of weighted transitive graphs with applications
- Tree decompositions with small cost
- Recognizing clique graphs of directed and rooted path graphs
- \(K_ i\)-covers. I: Complexity and polytopes
- Domination in convex and chordal bipartite graphs
- Partitions of graphs into one or two independent sets and cliques
- Nordhaus-Gaddum theorem for the distinguishing chromatic number
- On the parameterized complexity of multiple-interval graph problems
- Perspectives of Monge properties in optimization
- Nonpreemptive scheduling of independent tasks with prespecified processor allocations
- On the pathwidth of chordal graphs
- Dominating sets for split and bipartite graphs
- Determining uni-connectivity in directed graphs
- 2-role assignments on triangulated graphs.
- An optimal algorithm to solve the all-pair shortest path problem on interval graphs
- Threshold Dimension of Graphs
- On domination problems for permutation and other graphs
- Bandwidth of chain graphs
- The recognition of geodetically connected graphs
- Vertex ranking of asteroidal triple-free graphs
- Resource allocation in bounded degree trees
- Consecutive retrieval property -- revisited
- On the performance of the first-fit coloring algorithm on permutation graphs
- Recognizing cographs and threshold graphs through a classification of their edges
- Recognizing \(i\)-triangulated graphs in \(O(mn)\) time
- An approximation algorithm for clustering graphs with dominating diametral path
- On-line algorithms for the dominating set problem
- An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs
- Split graphs and Nordhaus-Gaddum graphs
- Circular convex bipartite graphs: feedback vertex sets
- Treewidth of cocomparability graphs and a new order-theoretic parameter
- Parameterized complexity of vertex colouring
- The maximum k-colorable subgraph problem for chordal graphs
- Pattern matching for permutations
- Once more on matrogenic graphs
- Synthesizing partial orders given comparability information: Partitive sets and slack in critical path networks
- Trapezoid graphs and generalizations, geometry and algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3328583)
