Pages that link to "Item:Q1230637"
From MaRDI portal
The following pages link to Some simplified NP-complete graph problems (Q1230637):
Displayed 50 items.
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- The complexity of finding two disjoint paths with min-max objective function (Q584275) (← links)
- New spectral lower bounds on the bisection width of graphs (Q596083) (← links)
- Exponential lower bounds for the tree-like Hajós calculus (Q673010) (← links)
- A linear-time algorithm for computing the intersection of all odd cycles in a graph (Q674917) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- Orthogonal segment stabbing (Q705557) (← links)
- Algorithms for the maximum satisfiability problem (Q753502) (← links)
- On optimal linear arrangements of trees (Q789395) (← links)
- On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems (Q791320) (← links)
- Some undecidable problems involving the edge-coloring and vertex-coloring of graphs (Q801935) (← links)
- Branch distance optimization of structured programs (Q805220) (← links)
- An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288) (← links)
- On the complexity of scheduling unit-time jobs with or-precedence constraints (Q813963) (← links)
- Packing \(r\)-cliques in weighted chordal graphs (Q817141) (← links)
- The bipartite margin shop and maximum red matchings free of blue-red alternating cycles (Q834189) (← links)
- On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P (Q845727) (← links)
- Constraint satisfaction with bounded treewidth revisited (Q847262) (← links)
- An efficient algorithm for solving pseudo clique enumeration problem (Q848935) (← links)
- Upper bounds on the bisection width of 3- and 4-regular graphs (Q849636) (← links)
- Routing with critical paths (Q910228) (← links)
- An efficient algorithm for edge coloring planar graphs with \(\Delta\) colors (Q914387) (← links)
- Methods for the one-dimensional space allocation problem (Q916571) (← links)
- Coloring certain proximity graphs (Q917569) (← links)
- Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845) (← links)
- Linear choosability of graphs (Q932648) (← links)
- Single-machine scheduling of multi-operation jobs without missing operations to minimize the total completion time (Q933504) (← links)
- A discrete filled function algorithm for approximate global solutions of max-cut problems (Q939569) (← links)
- Partition into cliques for cubic graphs: Planar case, complexity and approximation (Q947111) (← links)
- On complexity of special maximum matchings constructing (Q952636) (← links)
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs (Q995559) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- Parameterized algorithmics for linear arrangement problems (Q1003461) (← links)
- Complexity of conditional colorability of graphs (Q1003864) (← links)
- Bounds on isoperimetric values of trees (Q1011720) (← links)
- Cardinality constrained and multicriteria (multi)cut problems (Q1013079) (← links)
- On the complexity of finding balanced oneway cuts (Q1014383) (← links)
- Exact complexity of exact-four-colorability (Q1014384) (← links)
- Optimal one-page tree embeddings in linear time (Q1014395) (← links)
- A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems (Q1014949) (← links)
- Approximability of minimum AND-circuits (Q1024782) (← links)
- On star and caterpillar arboricity (Q1025569) (← links)
- The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree (Q1025950) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- Parameterized complexity of finding regular induced subgraphs (Q1026227) (← links)
- Stable marriage with ties and bounded length preference lists (Q1026229) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- The submodular knapsack polytope (Q1040079) (← links)
- Vertex- and edge-minimal and locally minimal graphs (Q1043552) (← links)
- Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs (Q1043806) (← links)