Searching for better fill-in

DOI10.1016/J.JCSS.2014.04.010zbMATH Open1311.68077OpenAlexW2043976475WikidataQ60488407 ScholiaQ60488407MaRDI QIDQ2453556FDOQ2453556

Authors: Fedor V. Fomin, Yngve Villanger 

Publication date: 10 June 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2014.04.010

Recommendations

• Searching for better fill-in
• Filling gaps in space filling
• Filling the nest gaps
• In search of the best approximant
• Improving best-reply search
• scientific article; zbMATH DE number 1304976
• Searching for searchers

zbMATH Keywords

local searchtriangulationparameterized complexitychordal graphminimum fill-in

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Direct Methods for Sparse Linear Systems
• Title not available (Why is that?)
• Fixed-parameter tractability of graph modification problems for hereditary properties
• Title not available (Why is that?)
• Incidence matrices and interval graphs
• Parametrized complexity theory.
• Title not available (Why is that?)
• Title not available (Why is that?)
• On rigid circuit graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimal triangulations of graphs: a survey
• On the Desirability of Acyclic Database Schemes
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Computing the Minimum Fill-In is NP-Complete
• Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Title not available (Why is that?)
• The Use of Linear Graphs in Gauss Elimination
• Stable assignment with couples: parameterized complexity and local search
• On Local Search and Placement of Meters in Networks
• Title not available (Why is that?)
• Counting clique trees and computing perfect elimination schemes in parallel
• Subexponential parameterized algorithm for minimum fill-in
• On the hardness of losing weight
• The parameterized complexity of local search for TSP, more refined
• Local search: is brute-force avoidable?
• The parameterized complexity of \(k\)-flip local search for SAT and MAX SAT
• Searching the \(k\)-change neighborhood for TSP is W[1]-hard
• Characterizations and algorithmic applications of chordal graph embeddings
• On treewidth and minimum fill-in of asteroidal triple-free graphs
• A characterisation of rigid circuit graphs
• Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
• On the Complexity of Local Search for the Traveling Salesman Problem
• Title not available (Why is that?)
• Parameterized complexity and local search approaches for the stable marriage problem with ties
• Parameterized complexity results for exact Bayesian network structure learning
• Title not available (Why is that?)
• Chordal completions of planar graphs
• A Polynomial Approximation Algorithm for the Minimum Fill-In Problem
• Faster parameterized algorithms for \textsc{Minimum Fill-in}
• Title not available (Why is that?)
• Minimal vertex separators of chordal graphs
• Title not available (Why is that?)

Cited In (2)

• Searching for better fill-in
• A revisit of the scheme for computing treewidth and minimum fill-in

Uses Software

• CSparse

This page was built for publication: Searching for better fill-in

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453556)