A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Filters
Complexity classification of some edge modification problems
2001
Discrete Applied Mathematics
Preserved Fulltext
We prove the NP-hardness of a variety of edge modiÿcation problems with respect to some well-studied classes of graphs. ...
We show that some of these problems become polynomial when the input graph has bounded degree. ...
Contribution of this paper In this paper we study the complexity of edge modiÿcation problems on some well-studied classes of graphs. ...
doi:10.1016/s0166-218x(00)00391-7
fatcat:rykmxhw5zbfnpajpub2u4xj4pa
Complexity Classification of Some Edge Modification Problems
[chapter]
1999
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We prove the NP-hardness of a variety of edge modiÿcation problems with respect to some well-studied classes of graphs. ...
We show that some of these problems become polynomial when the input graph has bounded degree. ...
Contribution of this paper In this paper we study the complexity of edge modiÿcation problems on some well-studied classes of graphs. ...
doi:10.1007/3-540-46784-x_8
fatcat:ndzpc7hmxfbyridleifgyrs7iu
Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems
2019
International Symposium on Parameterized and Exact Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We study the complexity of graph modification problems with respect to homomorphism-based colouring properties of edge-coloured graphs. ...
ACM Subject Classification Theory of computation → Graph algorithms analysis; Theory of computation → Parameterized complexity and exact algorithms ...
We perform such a classification by using some characteristics of the switch operation and by giving some reductions to well-known NPcomplete problems. ...
doi:10.4230/lipics.ipec.2019.15
dblp:conf/iwpec/FoucaudHLMP19
fatcat:vp6qubbztre7hlkyoppno3atqu
Divisive-agglomerative algorithm and complexity of automatic classification problems
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
An algorithm of solution of the Automatic Classification (AC for brevity) problem is set forth in the paper. ...
In the AC problem, it is required to find one or several artitions, starting with the given pattern matrix or dissimilarity, similarity matrix. ...
The article was prepared within the framework of the Basic Research Program at the National Research University Higher School of Economics (HSE) and supported within the framework of a subsidy granted ...
arXiv:1607.02419v1
fatcat:vrqpqqnatfd4bdw6x5pxpflmdq
Graph Sanitation with Application to Node Classification
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We formulate the graph sanitation problem as a bilevel optimization problem, and further instantiate it by semi-supervised node classification, together with an effective solver named GaSoliNe. ...
The past decades have witnessed the prosperity of graph mining, with a multitude of sophisticated models and algorithms designed for various mining tasks, such as ranking, classification, clustering and ...
As a comparison, the time complexity of computing ∇ A L is 𝑂 (𝑛 2 𝑑) and the space complexity of computing ∇ A L is 𝑂 (𝑛 2 ). ...
arXiv:2105.09384v2
fatcat:jix6z5eidvho3hdrcg3beg2cuu
Page 5203 of Mathematical Reviews Vol. , Issue 2002G
[page]
2002
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
of some edge modification problems. ...
We prove the NP-hardness of a variety of edge modification problems with respect to some well-studied classes of graphs. ...
The Mixed Chinese Postman Problem
Смешанная задача китайского почтальона
2017
Proceedings of the Institute for System Programming of RAS
Смешанная задача китайского почтальона
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The variants of CPP are pointed out. The mathematical formulations of some problems are presented. The algorithm for reduction the MCPP in multigraph into GTSP is shown. ...
The Chinese postman problem (CPP) is a special case of the routing problem, which has many potential applications. ...
In WCPP the cost of traversing some edge depends on way of traversing. ...
doi:10.15514/ispras-2017-29(4)-7
fatcat:il7lpcaahretlficgsgozkaqn4
Parenclitic Network Analysis of Methylation Data for Cancer Identification
2017
PLoS ONE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We make use of ideas from the theory of complex networks to implement a machine learning classification of human DNA methylation data, that carry signatures of cancer development. ...
We demonstrate that for the 10 types of cancer under study, it is possible to obtain a high performance of binary classification between cancer-positive and negative samples based on network measures. ...
M.I. acknowledges support of Russian Science Foundation grant No. 14-12-00811 (network statistics analysis). Computations were carried out on the Lobachevsky University supercomputer. ...
doi:10.1371/journal.pone.0169661
pmid:28107365
pmcid:PMC5249089
fatcat:dby5ybsqobflrmvkyzsoxelh6a
EVENT EXTRACTION WITH COMPLEX EVENT CLASSIFICATION USING RICH FEATURES
2010
Journal of Bioinformatics and Computational Biology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose an automatic event extraction system, which contains a model for complex events, by solving a classification problem with rich features. ...
To improve the biomedical event extraction systems, finding these complex events automatically is important; thus, we focus on the extraction of the complex events. ...
Instead of applying rules for extracting complex events, our system solves a new classification problem for complex events, and construct a new model for extracting complex events. ...
doi:10.1142/s0219720010004586
pmid:20183879
fatcat:hh4p26yjrvbw7g5s4gfvcwqjom
Parameterized complexity of edge-coloured and signed graph homomorphism problems
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We study the complexity of graph modification problems for homomorphism-based properties of edge-coloured graphs. ...
This is in contrast with the fact that already for some H of order 3, unless P=NP, none of the three considered problems is in XP. ...
We perform such a classification by using some characteristics of the switch operation and by giving some reductions to well-known NP-complete problems. ...
arXiv:1910.01099v1
fatcat:v66y4h4pejbhxldsib3hmrtbui
Adversarial Attack on Graph Structured Data
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We use both synthetic and real-world data to show that, a family of Graph Neural Network models are vulnerable to these attacks, in both graph-level and node-level classification tasks. ...
In this paper, we focus on the adversarial attacks that fool the model by modifying the combinatorial structure of data. ...
Tian Tian and Jun Zhu were supported by the National NSF of China (No. 61620106010) and Beijing Natural Science Foundation (No. L172037). ...
arXiv:1806.02371v1
fatcat:7yd7eccpybc2vo3tjwzry7oms4
Consistent Re-Modeling of Signaling Pathways and Its Implementation in the TRANSPATH Database
2004
Genome Informatics Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Each molecule is described in the context of a certain reaction in the multidimensional space of posttranslational modification, molecular family relationships, and the biological species of its origin ...
The data model of the signaling pathways database TRANSPATH has been re-engineered to a three-layer model comprising experimental evidences and summarized pathway information, both in a mechanistically ...
Takai-Igarashi, University of Tokyo. ...
doi:10.11234/gi1990.15.2_244
fatcat:urw3dchqtfe7nogvwwiwh2vtzm
New feature for Complex Network based on Ant Colony Optimization for High Level Classification
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
High Level features can be got from Complex Network created over the data. Local and global features are used to describe the structure of a Complex Network, i.e. ...
Low level classification extracts features from the elements, i.e. physical to use them to train a model for a later classification. ...
The present paper introduce a novel feature to explore the behaviour of Complex Networks based on Minimal Spanning Tree, Travelling Sale Problem. ...
arXiv:2008.12884v1
fatcat:ripglpndlzdfrf76mboz2e3sxe
Robust Real Time Moving People Detection in Surveillance Scenarios
2010
2010 7th IEEE International Conference on Advanced Video and Signal Based Surveillance
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In order to test and validate the algorithm, we have developed a dataset containing annotated surveillance sequences of different complexity levels focused on the pedestrians detection. ...
The algorithm is based on people appearance and defines a person model as the union of four models of body parts. Firstly, motion segmentation is performed to detect moving pixels. ...
At low levels of classification and background complexity C1 - Fig.3 (a) and (b)-, our method, Edge, outperforms or obtains the same results than the other approaches. ...
doi:10.1109/avss.2010.33
dblp:conf/avss/Garcia-MartinM10
fatcat:4ohj5pal45chvdqwph2ykdtsya
A checklist for ecological management of landscapes for conservation
2007
Ecology Letters
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
They include recognizing the importance of landscape mosaics (including the integration of terrestrial and aquatic areas), recognizing interactions between vegetation cover and vegetation configuration ...
The management of landscapes for biological conservation and ecologically sustainable natural resource use are crucial global issues. ...
Patch-based classifications of complex landscapes may be artefacts of mapping. ...
doi:10.1111/j.1461-0248.2007.01114.x
pmid:17927771
fatcat:4q3dr53pxvcflfboa4r63j7sau
« Previous
Showing results 1 — 15 out of 104,836 results