scientific article; zbMATH DE number 3859178
From MaRDI portal
Publication:3328583
Recommendations
Cited in
(only showing first 100 items - show all)- Permutation graphs and the weak Bruhat order
- Two strikes against perfect phylogeny
- The polytope of degree sequences
- Colinear Coloring on Graphs
- Variable sized online interval coloring with bandwidth
- Pathwidth is NP-Hard for Weighted Trees
- Counting Interval Graphs
- On Injective Colourings of Chordal Graphs
- Recognizing pseudo-median graphs
- Optimal scheduling on parallel machines for a new order class
- Strong Chordality of Graphs with Possible Loops
- A Subexponential Parameterized Algorithm for Proper Interval Completion
- Algorithmic aspects of clique-transversal and clique-independent sets
- Cliques that are tolerance digraphs
- A linear time algorithm to list the minimal separators of chordal graphs
- Computing the average distance of an interval graph
- Asymptotic enumeration of cographs
- Single step searching in weighted block graphs
- Exact algorithms for intervalizing coloured graphs
- Batch processing with interval graph compatibilities between tasks
- Efficient algorithms for centers and medians in interval and circular-arc graphs
- Characterizing –partitionable Cographs
- Coxeter groups and nonuniform complexity
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs
- On the minimum number of logical clauses inferred from examples
- Toughness in graphs -- a survey
- Algorithms for clique-independent sets on subclasses of circular-arc graphs
- An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time
- Polynomial and APX-hard cases of the individual haplotyping problem
- A generalization of the theorem of Lekkerkerker and Boland
- Chromatic polynomials and order ideals of monomials
- The Euclidean distance completion problem: cycle completability
- 2-Trees: Structural insights and the study of Hamiltonian paths
- Longest cycles in threshold graphs
- Localized and compact data-structure for comparability graphs
- On the computational complexity of the order polynomial
- Embedding mappings and splittings with applications
- Pathwidth of Circular-Arc Graphs
- On the null-homotopy of bridged graphs
- r-Domination problems on homogeneously orderable graphs
- Graph spanners
- Identifying phylogenetic trees
- On the chromatic number of multiple interval graphs and overlap graphs
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs
- Network transformations and bounding network reliability
- Hadwiger's conjecture for proper circular arc graphs
- Maximum weight independent sets in hole- and co-chair-free graphs
- Asteroidal Triple of Edges in Bichordal Graphs: A Complete list
- Embedding of Generalized Wheels into Arbitrary Trees
- Simple vertex ordering characterizations for graph search
- A Characterisation of the Minimal Triangulations of Permutation Graphs
- How to use the minimal separators of a graph for its chordal triangulation
- An efficient algorithm to solve the conditional covering problem on trapezoid graphs
- On the computational complexity of (maximum) shift class scheduling
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
- Counting endpoint sequences for interval orders and interval graphs
- Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs
- -threshold and -tolerance chain graphs
- A linear algorithm for the group path problem on chordal graphs
- Bounded discrete representations of interval orders
- Monge and feasibility sequences in general flow problems
- On generalized perfect graphs: Bounded degree and bounded edge perfection
- Sources in posets and comparability graphs
- No-hole (r+1)-distant colorings
- A lower bound on the period length of a distributed scheduler
- Two-step graphs of trees
- Testing balancedness and perfection of linear matrices
- Matrix completions and chordal graphs
- Schur products and matrix completions
- Polynomial time algorithms on circular-arc overlap graphs
- Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
- Asteroidal triples of moplexes
- Nonparametric estimation of the bivariate CDF for arbitrarily censored data
- Jump number maximization for proper interval graphs and series-parallel graphs
- On the minimum and maximum selective graph coloring problems in some graph classes
- First-fit coloring of bounded tolerance graphs
- Orientable edge colorings of graphs
- On independent vertex sets in subclasses of apple-free graphs
- scientific article; zbMATH DE number 1444474 (Why is no real title available?)
- An optimal algorithm to recognize Robinsonian dissimilarities
- On perfectness of sums of graphs
- Power domination in circular-arc graphs
- Estimation of graphical models whose conditional independence graphs are interval graphs and its application to modelling linkage disequilibrium
- Approximation of RNA multiple structural alignment
- Probability propagation
- Foreground memory management in data path synthesis
- Minimal vertex separators and new characterizations for dually chordal graphs
- Totally-Balanced and Greedy Matrices
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- A sequential algorithm for finding a maximum weightK-independent set on interval graphs
- On-line algorithms for orders
- The minimum-area spanning tree problem
- Matrix partitions of perfect graphs
- Precoloring extension. I: Interval graphs
- Independence and domination in polygon graphs
- Optimal separable partitioning in the plane
- Tight bounds for online weighted tree augmentation
- The neighborhood polynomial of chordal graphs
- Maximum weightk-independent set problem on permutation 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)
