A polynomial-time algorithm for near-unanimity graphs

Larose B; Loten C; Zadori L

首页> 外文期刊>Journal of Algorithms >A polynomial-time algorithm for near-unanimity graphs

【24h】

A polynomial-time algorithm for near-unanimity graphs

机译：近似一致图的多项式时间算法

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

We present a simple polynomial-time algorithm that recognises reflexive, symmetric graphs admitting a near-unanimity operation. Several other characterisations of these graphs are also presented. (c) 2004 Elsevier Inc. All rights reserved.

著录项

来源
《Journal of Algorithms》 |2005年第2期|共15页
作者
Larose B; Loten C; Zadori L;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类数学;
关键词
near-unanimity operation; reflexive graph; polynomial-time algorithm; CONSISTENCY; OPERATIONS;

机译：近一致操作自反图多项式时间算法一致性操作;
入库时间 2022-08-18 23:30:36

相似文献

外文文献
中文文献
专利

1. A polynomial-time algorithm for near-unanimity graphs [J] . Larose B, Loten C, Zadori L Journal of Algorithms . 2005,第2期

机译：近似一致图的多项式时间算法
2. Polynomial-time algorithms for SUBGRAPH ISOMORPHISM in small graph classes of perfect graphs [J] . Konagaya Matsuo, Otachi Yota, Uehara Ryuhei Discrete Applied Mathematics . 2016,第Null期

机译：完美图的小图类中子图等价的多项式时间算法
3. Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs [J] . Andreas Brandstaedt, Pavel Ficur, Arne Leitert, Information Processing Letters . 2015,第2期

机译：用于无AT图和双弦图的加权有效控制问题的多项式时间算法
4. Polynomial-Time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation Graphs [C] . Charis Papadopoulos, Spyridon Tzimas International Symposium on Fundamentals of Computation Theory . 2017

机译：区间图和置换图上子集反馈顶点集问题的多项式时间算法
5. Primality Testing is Polynomial-time: A Mechanised Verification of the AKS Algorithm [D] . Chan, Hing Lun. 2019

机译：原始测试是多项式 - 时间：AKS算法的机械化验证
6. Polynomial-Time Algorithms for Building a Consensus MUL-Tree [O] . Yun Cui, Jesper Jansson, Wing-Kin Sung -1

机译：建立共识MUL树的多项式时间算法
7. A polynomial-time algorithm for near-unanimity graphs [O] . Benoit Larose, Cynthia Loten, László Zádori 2005

机译：近似一致图的多项式时间算法

A polynomial-time algorithm for near-unanimity graphs

摘要

著录项

相似文献

相关主题

期刊订阅