Sciweavers

3105 search results - page 28 / 621
» The Path-Packing Structure of Graphs
Sort
View
115
Voted
ICALP
2011
Springer
14 years 4 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
117
Voted
ESA
2008
Springer
130views Algorithms» more  ESA 2008»
15 years 2 months ago
Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and ...
Christian Bachmaier, Wolfgang Brunner
AMC
2008
78views more  AMC 2008»
15 years 21 days ago
Information processing in complex networks: Graph entropy and information functionals
This paper introduces a general framework for defining the entropy of a graph. Our definition is based on a local information graph and on information functionals derived from the...
Matthias Dehmer
MVA
1996
15 years 1 months ago
Recognition of Composite Elements in Bar Graphs
The issue of graph recognition has been not always investigated until today though the subjects on the document image understanding are very interest and have proposed many method...
Naoko Yokokura, Toyohide Watanabe
ICPR
2004
IEEE
16 years 1 months ago
Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort
A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial ...
Fred W. DePiero