Even initial feedback vertex set problem is NP-complete

Dan A. Simovici; Gheorghe Grigoraş

doi:10.1016/0020-0190(79)90144-3

ScienceGate Book Chapters

JOURNAL ARTICLE

Even initial feedback vertex set problem is NP-complete

Dan A. Simovici Gheorghe Grigoraş

Year: 1979 Journal: Information Processing Letters Vol: 8 (2)Pages: 64-66 Publisher: Elsevier BV

DOI: 10.1016/0020-0190(79)90144-3

Get Full-Text PDF Get Analytical Report

Keywords:

SPARQL RDF RDF Schema Simple Knowledge Organization System RDF/XML Computer science RDF query language Cwm Linked data Information retrieval Database Semantic Web Web search query Web query classification Search engine

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.26

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Database Systems and Queries

Physical Sciences → Computer Science → Computer Networks and Communications

Semantic Web and Ontologies

Physical Sciences → Computer Science → Artificial Intelligence

Data Management and Algorithms

Physical Sciences → Computer Science → Signal Processing

Even initial feedback vertex set problem is NP-complete

Metrics

Citation History

Topics

Related Documents

Quantum Feasibility Labeling for NP-Complete Vertex Coloring Problem

An NP-complete matching problem

Kaboozle Is NP-complete, Even in a Strip

Vertex-magic total labelings of even complete graphs

Vertex dimension of complete graphs on even vertices