scientific article; zbMATH DE number 3859178
From MaRDI portal
Publication:3328583
Recommendations
Cited in
(only showing first 100 items - show all)- Online Bounded Coloring of Permutation and Overlap Graphs
- Perfect edge domination and efficient edge domination in graphs
- Covering orthogonal polygons with star polygons: The perfect graph approach
- An optimal greedy heuristic to color interval graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- On the non-unit count of interval graphs
- Some results about the interval number of a graph
- Vertex ranking of asteroidal triple-free graphs
- Batch processing with interval graph compatibilities between tasks
- Positive semidefinite matrices with a given sparsity pattern
- On embedding graphs in trees
- Solving the weighted efficient edge domination problem on bipartite permutation graphs
- The pathwidth and treewidth of cographs
- Dominating cliques in graphs
- Enumeration of difference graphs
- Clique graphs of time graphs
- Algorithms for weakly triangulated graphs
- Random interval graphs
- Graphic presentations of isotropic systems
- Reducing prime graphs and recognizing circle graphs
- Powers of distance-hereditary graphs
- The Hamiltonian problem on distance-hereditary graphs
- An exact method for graph coloring
- Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
- A tutorial on the use of graph coloring for some problems in robotics
- On the unit interval number of a graph
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
- Toughness in graphs -- a survey
- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- On the complexity of the positive semidefinite zero forcing number
- The weighted perfect domination problem
- Weighted independent perfect domination on cocomparability graphs
- Bipartite permutation graphs with application to the minimum buffer size problem
- On a graph-theoretical model for cyclic register allocation
- Toughness, hamiltonicity and split graphs
- Treewidth computations. I: Upper bounds
- Algorithms for solving problems on graphs of bounded pathwidth
- Recognition and characterization of chronological interval digraphs
- A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
- Recognizing locally equivalent graphs
- Complexity classification of some edge modification problems
- Dominating cliques in distance-hereditary graphs
- On the approximability of an interval scheduling problem
- The conditional covering problem on unweighted interval graphs with nonuniform coverage radius
- Möbius functions and confluent semi-commutations
- On dimensional properties of graphs
- Some properties of minimal imperfect graphs
- Edge-clique graphs
- Parallel algorithm for cograph recognition with applications
- A lower bound for the job insertion problem.
- A linear time algorithm for finding all hinge vertices of a permutation graph
- On algorithms for (\(P_5\), gem)-free graphs
- Digraph matrix partitions and trigraph homomorphisms
- A solution method for a car fleet management problem with maintenance constraints
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- A sequential algorithm for finding a maximum weightK-independent set on interval graphs
- Parameterized coloring problems on chordal graphs
- Trapezoid graphs and generalizations, geometry and algorithms
- Norbert Wiener on the theory of measurement (1914, 1915, 1921)
- Weighted efficient domination problem on some perfect graphs
- Clique tree generalization and new subclasses of chordal graphs
- Interval scheduling on identical machines
- Identifying phylogenetic trees
- Inverse chromatic number problems in interval and permutation graphs
- The algorithmic complexity of mixed domination in graphs
- Asteroidal triple-free graphs
- Chordal deletion is fixed-parameter tractable
- Selection of programme slots of television channels for giving advertisement: a graph theoretic approach
- Decomposition of balanced matrices
- Complexity of approximating the oriented diameter of chordal graphs
- Matrix partitions of perfect graphs
- Reconnaissance des graphes de cordes
- New results on induced matchings
- Chronological rectangle digraphs
- Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs
- On containment graphs of paths in a tree
- Optimal packing and covering in the plane are NP-complete
- Maximum induced matchings for chordal graphs in linear time
- Tri-connectivity augmentation in trees
- Largest chordal and interval subgraphs faster than \(2^n\)
- Notes on a theorem of Naji
- A survey of the algorithmic aspects of modular decomposition
- Block duplicate graphs and a hierarchy of chordal graphs
- Finding Hamiltonian circuits in interval graphs
- The off-line group seat reservation problem
- Optimal channel allocation for several types of cellular radio networks
- An optimal parallel algorithm to construct a tree 3-spanner on interval graphs
- Embedding of cycles and wheels into arbitrary trees
- Online independent sets.
- Colourings, homomorphisms, and partitions of transitive digraphs
- An optimal parallel algorithm for computing cut vertices and blocks on interval graphs
- Dot product representations of graphs
- A note on superbrittle graphs
- Extermal positive semidefinite matrices with given sparsity pattern
- On the structure of graphs with few \(P_4\)s
- Partition-distance: A problem and class of perfect graphs arising in clustering
- New sufficient conditions for \(\alpha\)-redundant vertices
- Hamiltonian circuits in interval graph generalizations
- An evolution of interval graphs
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)
