A review of tree convex sets test
DOI10.1111/J.1467-8640.2012.00418.XzbMATH Open1251.91034OpenAlexW2154658620MaRDI QIDQ4649838FDOQ4649838
Authors: Forrest Sheng Bao, Yuanlin Zhang 
Publication date: 15 November 2012
Published in: Computational Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1467-8640.2012.00418.x
Recommendations
- Set cover, set packing and hitting set for tree convex and tree-like set systems
- Properties of tree convex constraints
- An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph
- Convex tree realizations of partitions
- An algorithm for finding input-output constrained convex sets in an acyclic digraph
constraint satisfaction problemsconsecutive ones propertytree convex setscombinatorial auction problemsrow convex constraints
Applications of graph theory (05C90) Programming involving graphs or networks (90C35) Auctions, bargaining, bidding and selling, and other market models (91B26)
Cites Work
- Consistency in networks of relations
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Incidence matrices and interval graphs
- Computationally manageable combinational auctions
- Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
- 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
- Networks of constraints: Fundamental properties and applications to picture processing
- Tree clustering for constraint networks
- BOB: Improved winner determination in combinatorial auctions and generalizations
- Power of Natural Semijoins
- A Simple Test for the Consecutive Ones Property
- Degrees of acyclicity for hypergraphs and relational database schemes
- Syntactic Characterization of Tree Database Schemas
- On the consecutive ones property
- Synthesizing constraint expressions
Cited In (21)
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms
- Global total \(k\)-domination: approximation and hardness results
- Exact square coloring of certain classes of graphs: complexity and algorithms
- Circular convex bipartite graphs: feedback vertex set
- On partial Grundy coloring of bipartite graphs and chordal graphs
- Domination in some subclasses of bipartite graphs
- Circular convex bipartite graphs: feedback vertex sets
- Feedback vertex sets on restricted bipartite graphs
- Maximum weight induced matching in some subclasses of bipartite graphs
- Algorithmic and complexity aspects of problems related to total restrained domination for graphs
- Differentiating-total domination: approximation and hardness results
- Complexity and algorithms for injective edge coloring of graphs
- Acyclic matching in some subclasses of graphs
- Hardness results of connected power domination for bipartite graphs and chordal graphs
- Dominating induced matching in some subclasses of bipartite graphs
- Set cover, set packing and hitting set for tree convex and tree-like set systems
- Union closed tree convex sets
- On the complexity of minimum maximal uniquely restricted matching
- Preferences single-peaked on a tree: multiwinner elections and structural results
- Acyclic Matching in Some Subclasses of Graphs
- Injective coloring of some subclasses of bipartite graphs and chordal graphs
This page was built for publication: A review of tree convex sets test
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649838)
