Pages that link to "Item:Q2395457"
From MaRDI portal
The following pages link to Incidence matrices and interval graphs (Q2395457):
Displayed 50 items.
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- The complexity of manipulative attacks in nearly single-peaked electorates (Q490458) (← links)
- Interval graph representation with given interval and intersection lengths (Q491160) (← links)
- On the non-unit count of interval graphs (Q496432) (← links)
- On a class of graphs between threshold and total domishold graphs (Q496435) (← links)
- The list distinguishing number equals the distinguishing number for interval graphs (Q503677) (← links)
- Unit interval editing is fixed-parameter tractable (Q515577) (← links)
- Strict chordal and strict split digraphs (Q516787) (← links)
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- Separator orders in interval, cocomparability, and AT-free graphs (Q534331) (← links)
- Bridges between deterministic and probabilistic models for binary data (Q537421) (← links)
- Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228) (← links)
- Reconstruction of interval graphs (Q604467) (← links)
- The shield that never was: societies with single-peaked preferences are more open to manipulation and control (Q627120) (← links)
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances (Q633846) (← links)
- Crown-free lattices and their related graphs (Q651416) (← links)
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- Minimal obstructions for partial representations of interval graphs (Q668026) (← links)
- Continuation methods for approximate large scale object sequencing (Q669313) (← links)
- \texttt{PQser:} a Matlab package for spectral seriation (Q670489) (← links)
- Edge domination on bipartite permutation graphs and cotriangulated graphs (Q672265) (← links)
- A note on lexicographic breadth first search for chordal graphs (Q673001) (← links)
- Efficient parallel recognition of some circular arc graphs. II (Q675297) (← links)
- Structure of concurrency (Q685384) (← links)
- Counting endpoint sequences for interval orders and interval graphs (Q685648) (← links)
- Basic derivations for subarrangements of Coxeter arrangements (Q687005) (← links)
- Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings (Q690497) (← links)
- A faster algorithm for finding minimum Tucker submatrices (Q693064) (← links)
- Selected combinatorial problems of computational biology (Q706944) (← links)
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs (Q712269) (← links)
- Algorithmic aspects of \(b\)-disjunctive domination in graphs (Q721940) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- Efficient algorithms for network localization using cores of underlying graphs (Q742409) (← links)
- Special eccentric vertices for the class of chordal graphs and related classes (Q742574) (← links)
- Freeness of hyperplane arrangements between Boolean arrangements and Weyl arrangements of type \(B_{\ell}\) (Q783056) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- Optimal weighing designs with a string property (Q792048) (← links)
- Some aspects of perfect elimination orderings in chordal graphs (Q792351) (← links)
- Separating subgraphs in k-trees: Cables and caterpillars (Q795842) (← links)
- Circular representation problem on hypergraphs (Q799695) (← links)
- Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- A vertex incremental approach for maintaining chordality (Q819824) (← links)
- Minimal separators in \(P_4\)-sparse graphs (Q819831) (← links)
- Lex M versus MCS-M (Q819832) (← links)
- On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555) (← links)
- Reactive and proactive single-machine scheduling to maintain a maximum number of starting times (Q829172) (← links)
- Vertex rankings of chordal graphs and weighted trees (Q844166) (← links)
- Inducing a blockmodel structure of two-mode binary data using seriation procedures (Q856645) (← links)
- Alexandrov's inequality and conjectures on some Toeplitz matrices (Q869926) (← links)